Private Coins versus Public Coins in Zero-Knowledge Proof Systems
From MaRDI portal
Publication:3408218
DOI10.1007/978-3-642-11799-2_35zbMath1274.94104OpenAlexW1495652222MaRDI QIDQ3408218
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_35
Related Items (3)
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- How to construct constant-round zero-knowledge proof systems for NP
- Concurrent zero-knowledge. With additional background by Oded Goldreich
- On transformation of interactive proofs that preserve the prover's complexity
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- An Equivalence Between Zero Knowledge and Commitments
- On the Composition of Public-Coin Zero-Knowledge Protocols
- Theory of Cryptography
This page was built for publication: Private Coins versus Public Coins in Zero-Knowledge Proof Systems
