Symmetric Authentication within a Simulatable Cryptographic Library
From MaRDI portal
Publication:5030211
DOI10.1007/978-3-540-39650-5_16zbMath1482.94039OpenAlexW1605744481MaRDI QIDQ5030211
Michael Waidner, Michael Backes, Birgit Pfitzmann
Publication date: 16 February 2022
Published in: Computer Security – ESORICS 2003 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-39650-5_16
Related Items (14)
Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ Composable Security in the Bounded-Quantum-Storage Model ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ Weakening the perfect encryption assumption in Dolev-Yao adversaries ⋮ On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation ⋮ A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Conditional Reactive Simulatability ⋮ Machine-Checked Security Proofs of Cryptographic Signature Schemes ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A calculus for cryptographic protocols: The spi calculus
- Three systems for cryptographic protocol analysis
- Player simulation and general adversary structures in perfect multiparty computation
- Keying Hash Functions for Message Authentication
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- On the security of public key protocols
This page was built for publication: Symmetric Authentication within a Simulatable Cryptographic Library
