Symmetric authentication within a simulatable cryptographic library

DOI10.1007/978-3-540-39650-5_16MaRDI QIDQ5030211zbMATH OpenOpenAlexFDO

Authors Michael Backes, Birgit Pfitzmann, Michael Waidner

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

zbMATH Keywords

authentication schemecryptographic operationhonest usermessage authenticationreal adversary

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Foundations of Security Analysis and Design III
• On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
• A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
• Security proof with dishonest keys
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cites work

• A calculus for cryptographic protocols: The spi calculus
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• scientific article; zbMATH DE number 1497864 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• scientific article; zbMATH DE number 2242582 (Why is no real title available?)
• Keying hash functions for message authentication
• On the security of public key protocols
• Player simulation and general adversary structures in perfect multiparty computation
• Three systems for cryptographic protocol analysis

Cited in

(18)

• Computationally sound implementations of equational theories against passive adversaries
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• Real-or-random key secrecy of the Otway-Rees protocol via a symbolic security proof
• Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
• Composable Security in the Bounded-Quantum-Storage Model
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
• Information Security
• Statistical Security Conditions for Two-Party Secure Function Evaluation
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• 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
• Foundations of Security Analysis and Design III

This page was built for publication: Symmetric authentication within a simulatable cryptographic library

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030211)