How to simulate it -- a tutorial on the simulation proof technique
From MaRDI portal
Publication:5021134
DOI10.1007/978-3-319-57048-8_6zbMATH Open1481.94111OpenAlexW2400124473MaRDI QIDQ5021134FDOQ5021134
Authors: Yehuda Lindell 
Publication date: 12 January 2022
Published in: Tutorials on the Foundations of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57048-8_6
Recommendations
Cites Work
- Probabilistic encryption
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- How to construct constant-round zero-knowledge proof systems for NP
- Security and composition of multiparty cryptographic protocols
- The random oracle methodology, revisited.
- A note on constant-round zero-knowledge proofs of knowledge
- Title not available (Why is that?)
- Foundations of Cryptography
- Strict Polynomial-Time in Simulation and Extraction
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- A Framework for Efficient and Composable Oblivious Transfer
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient secure two-party protocols. Techniques and constructions
- Definitions and properties of zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
- Number-theoretic constructions of efficient pseudo-random functions
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the limitations of universally composable two-party computation without set-up assumptions
- Universally composable two-party and multi-party secure computation
- Title not available (Why is that?)
- Random Oracles and Auxiliary Input
- Adaptively Secure Two-Party Computation with Erasures
- Title not available (Why is that?)
- Handling expected polynomial-time strategies in simulation-based security proofs
- A simpler variant of universally composable security for standard multiparty computation
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
Cited In (28)
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Computational hardness of optimal fair computation: beyond Minicrypt
- On the exact round complexity of secure three-party computation
- Title not available (Why is that?)
- Linear-time 2-party secure merge from additively homomorphic encryption
- Steganography-free zero-knowledge
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Categorical composable cryptography: extended version
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- On the complexity of simulating auxiliary input
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Predicate private set intersection with linear complexity
- Pen and Paper Arguments for SIMON and SIMON-like Designs
- Black-box transformations from passive to covert security with public verifiability
- Two-round oblivious transfer from CDH or LPN
- Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
- A coercion-resistant blockchain-based E-voting protocol with receipts
- Privacy in population protocols with probabilistic scheduling
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Threshold private set intersection with better communication complexity
- MPClan: protocol suite for privacy-conscious computations
- OpenPGP email forwarding via diverted elliptic curve Diffie-Hellman key exchanges
- When is a semi-honest secure multiparty computation valuable?
- SecureTLM: private inference for transformer-based large model with MPC
This page was built for publication: How to simulate it -- a tutorial on the simulation proof technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021134)
