Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes

DOI10.1007/11863908_25zbMath1487.94102OpenAlexW1499912117MaRDI QIDQ5862528

Michael Backes, Birgit Pfitzmann, Michael Waidner

Publication date: 9 March 2022

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

Full work available at URL: https://doi.org/10.1007/11863908_25

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Model Checking Security Protocols ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions

Cites Work

• Logics for reasoning about cryptographic constructions
• On the security of public key protocols
• 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
• Automata, Languages and Programming
• A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
• Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item