Sound and complete computational interpretation of symbolic hashes in the standard model
From MaRDI portal
Publication:2481980
DOI10.1016/j.tcs.2007.11.011zbMath1136.68023OpenAlexW2038704899MaRDI QIDQ2481980
Peter van Rossum, Flavio D. Garcia
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.011
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computational interpretation of Dolev-Yao adversaries
- Probabilistic encryption
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions
- The random oracle methodology, revisited
- Security analysis of cryptographically controlled access to XML documents
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- On the security of public key protocols
- Foundations of Cryptography
- Nonmalleable Cryptography
- Models of Objective Chance: An Analysis through Examples
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- Theory of Cryptography
- Fast Software Encryption
- Automata, Languages and Programming
- Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes
- Soundness of Formal Encryption in the Presence of Key-Cycles
- Foundations of Software Science and Computation Structures
- Theory of Cryptography
