Individual simulations
From MaRDI portal
Publication:2691606
DOI10.1007/978-3-030-64840-4_27OpenAlexW4233381483MaRDI QIDQ2691606
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_27
three-round concurrent zero knowledge and concurrent witness hidingtwo-round selective opening secure commitment scheme
Related Items (2)
Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum disclosure proofs of knowledge
- On the existence of three round zero-knowledge proofs
- Distinguisher-dependent simulation in two rounds and its applications
- On secure two-party computation in three rounds
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Non-uniformly sound certificates with applications to concurrent zero-knowledge
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs
- Point Obfuscation and 3-Round Zero-Knowledge
- On Round-Optimal Zero Knowledge in the Bare Public-Key Model
- (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
- Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge
- Resettable zero-knowledge (extended abstract)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Magic Functions
- Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- The Knowledge Complexity of Interactive Proof Systems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Revisiting Lower and Upper Bounds for Selective Decommitments
- Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
- Fiat-Shamir: from practice to theory
- Weak zero-knowledge beyond the black-box barrier
- From Weak to Strong Zero-Knowledge and Applications
- Limits of provable security from standard assumptions
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- Impossibility and Feasibility Results for Zero Knowledge with Public Keys
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way
- Non-interactive Zaps and New Techniques for NIZK
This page was built for publication: Individual simulations
