Zero knowledge with efficient provers
DOI10.1145/1132516.1132559zbMATH Open1301.94124OpenAlexW2119602408MaRDI QIDQ2931393FDOQ2931393
Authors: Minh-Huyen Nguyen, Salil Vadhan 
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132559
Recommendations
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)
Cited In (41)
- On Efficient Zero-Knowledge PCPs
- Provably Hard Zero-Way Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Efficient proofs of knowledge for threshold relations
- Title not available (Why is that?)
- Zero-knowledge proofs for committed symmetric Boolean functions
- Title not available (Why is that?)
- An Equivalence Between Zero Knowledge and Commitments
- Zero-knowledge proofs of proximity
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Languages with efficient zero-knowledge PCPs are in SZK
- Direct Zero Knowledge Proofs of Computational Power in Five Rounds
- Title not available (Why is that?)
- Zero Knowledge and Soundness Are Symmetric
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- The Complexity of Zero Knowledge
- Scalable zero knowledge with no trusted setup
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
- Updatable Zero-Knowledge Databases
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
- Advances in Cryptology - CRYPTO 2003
- Zero-knowledge proofs of knowledge for group homomorphisms
- Precise zero-knowledge arguments with poly-logarithmic efficiency
- Zero-Knowledge Proofs with Witness Elimination
- Title not available (Why is that?)
- Zero-Knowledge Proofs
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Strong batching for non-interactive statistical zero-knowledge
- Efficient zero-knowledge proof systems
- Zero-knowledge elementary databases with more expressive queries
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs
- Interactive Hashing: An Information Theoretic Tool (Invited Talk)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Composition of zero-knowledge proofs with efficient provers
- Zero‐Knowledge Proofs
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
This page was built for publication: Zero knowledge with efficient provers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931393)
