A computational interpretation of Dolev-Yao adversaries

DOI10.1016/j.tcs.2005.03.003zbMath1068.94022OpenAlexW1999863358MaRDI QIDQ557888

Jonathan Herzog

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.003

zbMATH Keywords

Dolev-Yao modelComputational soundnessFormal encryptionNon-malleability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items

Universally composable symbolic security analysis, Sound and complete computational interpretation of symbolic hashes in the standard model, Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings, A survey of symbolic methods in computational analysis of cryptographic systems, Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in cryptology - CRYPTO '98. 18th annual international cryptology conference, Santa Barbara, CA, USA, August 23--27, 1998. Proceedings
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• On the security of public key protocols
• A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Advances in Cryptology - CRYPTO 2003
• CONCUR 2003 - Concurrency Theory
• Theory of Cryptography