A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol

DOI10.1007/978-3-540-30108-0_6zbMath1487.94099OpenAlexW1805869620MaRDI QIDQ5862307

Michael Backes

Publication date: 7 March 2022

Published in: Computer Security – ESORICS 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30108-0_6

zbMATH Keywords

symmetric encryptionconsistency propertycryptographic protocolcommitment problemsecurity proof

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR

Cites Work

• Probabilistic encryption
• A calculus for cryptographic protocols: The spi calculus
• Logics for reasoning about cryptographic constructions
• The Knowledge Complexity of Interactive Proof Systems
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• A logic of authentication
• A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
• Symmetric Authentication within a Simulatable Cryptographic Library
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol