Comparing two notions of simulatability
From MaRDI portal
Recommendations
- Computing bisimulation-based comparisons
- scientific article; zbMATH DE number 7361363
- A modular approach to defining and characterising notions of simulation
- scientific article; zbMATH DE number 3986645
- Algebra and Coalgebra in Computer Science
- On similarity and duality of computation (I)
- Comparing notions of randomness
- Simulations as homotopies
- On checking equivalence of simulation scripts
Cited in
(15)- On the relationships between notions of simulation-based security
- Simulatable channels: extended security that is universally composable and easier to prove
- Everlasting multi-party computation
- The IITM model: a simple and expressive model for universal composability
- Polynomial runtime and composability
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Improved cryptographic puzzle based on~modular exponentiation
- On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
- How to simulate it -- a tutorial on the simulation proof technique
- Information Security
- On the relationships between notions of simulation-based security
- Conditional reactive simulatability
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (extended abstract)
- Universal reductions: reductions relative to stateful oracles
This page was built for publication: Comparing two notions of simulatability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711669)
