Conditional reactive simulatability

DOI10.1007/11863908_26MaRDI QIDQ5862529zbMATH OpenOpenAlexFDO

Authors Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters

Publication date 9 March 2022

Published in Computer Security – ESORICS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11863908_26

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Information Security
• Theory of Cryptography
• On the relationships between notions of simulation-based security
• The reactive simulatability (RSIM) framework for asynchronous systems
• Theory of Cryptography

Cites work

• scientific article; zbMATH DE number 1583788 (Why is no real title available?)
• scientific article; zbMATH DE number 1583804 (Why is no real title available?)
• scientific article; zbMATH DE number 1722692 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Composition of secure multi-party protocols. A comprehensive study.
• Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• New notions of security: achieving universal composability without trusted setup
• On the composition of authenticated byzantine agreement
• Proofs of Networks of Processes
• Symmetric authentication within a simulatable cryptographic library
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Universally composable two-party and multi-party secure computation

Cited in

(11)

• The Layered Games Framework for Specifications and Analysis of Security Protocols
• Theory of Cryptography
• Information Security
• Conditional automata: a tool for safe removal of negligible events
• The reactive simulatability (RSIM) framework for asynchronous systems
• Unifying simulatability definitions in cryptographic systems under different timing assumptions (extended abstract)
• On the insider security of MLS
• Adaptive security of multi-party protocols, revisited
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• Simulatable channels: extended security that is universally composable and easier to prove
• Overcoming impossibility results in composable security using interval-wise guarantees

This page was built for publication: Conditional reactive simulatability

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