Limits of the Cryptographic Realization of Dolev-Yao-Style XOR

DOI10.1007/11555827_11zbMath1487.94101OpenAlexW1599617995MaRDI QIDQ5862666

Birgit Pfitzmann, Michael Backes

Publication date: 9 March 2022

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

Full work available at URL: https://doi.org/10.1007/11555827_11

zbMATH Keywords

cryptographic protocolreactive simulatabilitycryptographic systemcryptographic operationpayload data

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Model Checking Security Protocols ⋮ Universally composable symbolic security analysis ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Conditional Reactive Simulatability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Security and composition of multiparty cryptographic protocols
• On the security of public key protocols
• Symmetric Authentication within a Simulatable Cryptographic Library
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Verification: Theory and Practice
• Programming Languages and Systems
• Programming Languages and Systems
• Automata, Languages and Programming
• Automata, Languages and Programming
• A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: Limits of the Cryptographic Realization of Dolev-Yao-Style XOR