Conditional Reactive Simulatability

DOI10.1007/11863908_26zbMATH Open1487.94100OpenAlexW1490687381MaRDI QIDQ5862529FDOQ5862529

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

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)

Cites Work

• The Knowledge Complexity of Interactive Proof Systems
• Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
• Proofs of Networks of Processes
• Composition of secure multi-party protocols. A comprehensive study.
• Universally composable two-party and multi-party secure computation
• New notions of security
• Theory of Cryptography
• Symmetric Authentication within a Simulatable Cryptographic Library
• Theory of Cryptography
• Theory of Cryptography
• On the composition of authenticated byzantine agreement
• Theory of Cryptography
• Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• The Layered Games Framework for Specifications and Analysis of Security Protocols
• The reactive simulatability (RSIM) framework for asynchronous systems
• On the insider security of MLS
• Adaptive security of multi-party protocols, revisited
• 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)