How to simulate it -- a tutorial on the simulation proof technique
From MaRDI portal
Recommendations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A note on constant-round zero-knowledge proofs of knowledge
- A simpler variant of universally composable security for standard multiparty computation
- Adaptively Secure Two-Party Computation with Erasures
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Definitions and properties of zero-knowledge proof systems
- Efficient secure two-party protocols. Techniques and constructions
- Foundations of Cryptography
- Foundations of Cryptography
- Handling expected polynomial-time strategies in simulation-based security proofs
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- Number-theoretic constructions of efficient pseudo-random functions
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- On the Composition of Zero-Knowledge Proof Systems
- On the limitations of universally composable two-party computation without set-up assumptions
- Probabilistic encryption
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Random Oracles and Auxiliary Input
- Security and composition of multiparty cryptographic protocols
- Strict Polynomial-Time in Simulation and Extraction
- The Knowledge Complexity of Interactive Proof Systems
- The random oracle methodology, revisited.
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
Cited in
(35)- On the complexity of simulating auxiliary input
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- OpenPGP email forwarding via diverted elliptic curve Diffie-Hellman key exchanges
- Black-box transformations from passive to covert security with public verifiability
- Two-round oblivious transfer from CDH or LPN
- Computational hardness of optimal fair computation: beyond Minicrypt
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Pen and Paper Arguments for SIMON and SIMON-like Designs
- scientific article; zbMATH DE number 6720710 (Why is no real title available?)
- When is a semi-honest secure multiparty computation valuable?
- scientific article; zbMATH DE number 5520539 (Why is no real title available?)
- scientific article; zbMATH DE number 7361363 (Why is no real title available?)
- On the exact round complexity of secure three-party computation
- Threshold private set intersection with better communication complexity
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- MPClan: protocol suite for privacy-conscious computations
- A coercion-resistant blockchain-based E-voting protocol with receipts
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Linear-time 2-party secure merge from additively homomorphic encryption
- Steganography-free zero-knowledge
- Categorical composable cryptography: extended version
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
- Predicate private set intersection with linear complexity
- SecureTLM: private inference for transformer-based large model with MPC
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Privacy in population protocols with probabilistic scheduling
- Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
- \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
- Willow: secure aggregation with one-shot clients
- Deletions and dishonesty: probabilistic data structures in adversarial settings
- MetaDORAM: info-theoretic distributed ORAM with less communication
- Amortizing Circuit-PSI in the multiple sender/receiver setting
- A new paradigm for server-aided 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)
