On the relationships between notions of simulation-based security

DOI10.1007/s00145-008-9019-9zbMath1182.68084OpenAlexW2043460186MaRDI QIDQ1021241

John C. Mitchell, Anupam Datta, Ralf Küsters, Ajith Ramanathan

Publication date: 8 June 2009

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

Full work available at URL: https://doi.org/10.1007/s00145-008-9019-9

zbMATH Keywords

process calculussimulation-based securityuniversal composabilityBlack-Box simulatabilityreactive simulatability

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Embedding the UC model into the IITM model, The IITM model: a simple and expressive model for universal composability, A survey of symbolic methods in computational analysis of cryptographic systems, Quantifying information flow in cryptographic systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• A calculus for cryptographic protocols: The spi calculus
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Reactively Secure Signature Schemes
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• Universally composable two-party and multi-party secure computation
• A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
• Mobile values, new names, and secure communication
• Foundations of Software Science and Computation Structures
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography