On the relationships between notions of simulation-based security

DOI10.1007/S00145-008-9019-9MaRDI QIDQ1021241zbMATH OpenOpenAlexFDO

Authors Ralf Küsters, Anupam Datta, John Mitchell, 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

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

Recommendations

• Theory of Cryptography
• Information Security
• Simulation based security in the applied pi calculus
• Simulation of security protocols based on scenarios of attacks
• On the achievability of simulation-based security for functional encryption
• Secure non-interactive simulation: feasibility and rate

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2009949 (Why is no real title available?)
• scientific article; zbMATH DE number 1487486 (Why is no real title available?)
• scientific article; zbMATH DE number 2086716 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• A calculus of communicating systems
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Foundations of Software Science and Computation Structures
• Mobile values, new names, and secure communication
• Reactively secure signature schemes
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• Universally composable two-party and multi-party secure computation

Cited in

(8)

• The IITM model: a simple and expressive model for universal composability
• Theory of Cryptography
• Simulation based security in the applied pi calculus
• Embedding the UC model into the IITM model
• Quantifying information flow in cryptographic systems
• A survey of symbolic methods in computational analysis of cryptographic systems
• Simulatable channels: extended security that is universally composable and easier to prove
• Conditional reactive simulatability

This page was built for publication: On the relationships between notions of simulation-based security

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