Network Security White Papers
Symmetric Authentication Within a Simulatable Cryptographic Library
Overview Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs are independent of cryptographic details. The typical abstraction is the Dolev-Yao model, which treats cryptographic operations as a specific term algebra. However, there is no cryptographic semantics, i.e., no theorem that says what a proof with the Dolev-Yao abstraction implies for the real protocol, even if provably secure cryptographic primitives are used. An extension to the Dolev-Yao model was introduced for which such a cryptographic semantics exists, i.e., where security is preserved if the abstractions are instantiated with provably secure cryptographic primitives. This model is extended to include a first symmetric primitive, message authentication, and prove that the extended model still has all desired properties.
| Publisher | Springer Science+Business Media | File Format | |
|---|---|---|---|
| Date Published | October 2003 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
