Universally composable symbolic security analysis

DOI10.1007/s00145-009-9055-0zbMath1208.94039OpenAlexW2117301329MaRDI QIDQ2429708

Ran Canetti, Jonathan Herzog

Publication date: 1 April 2011

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-009-9055-0

Mathematics Subject Classification ID

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

Related Items

Universally composable anonymous hash certification model ⋮ Formal Abstractions for Attested Execution Secure Processors

Uses Software

• ProVerif

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational interpretation of Dolev-Yao adversaries
• An attack on the Needham-Schroeder public-key authentication protocol
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Probabilistic encryption
• A calculus for cryptographic protocols: The spi calculus
• Definitions and properties of zero-knowledge proof systems
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Security and composition of multiparty cryptographic protocols
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Notion of Security for Probabilistic Cryptosystems
• The Knowledge Complexity of Interactive Proof Systems
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Nonmalleable Cryptography
• Analyzing security protocols with secrecy types and logic programs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Programming Languages and Systems
• Trustworthy Global Computing
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Theory of Cryptography

This page was built for publication: Universally composable symbolic security analysis