Zero knowledge with efficient provers

DOI10.1145/1132516.1132559MaRDI QIDQ2931393zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitycryptographyzero-knowledgelanguage-dependent commitment schemes

Mathematics Subject Classification ID

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)

Recommendations

• Composition of zero-knowledge proofs with efficient provers
• An Unconditional Study of Computational Zero Knowledge
• Languages with efficient zero-knowledge PCPs are in SZK
• On relationships between statistical zero-knowledge proofs
• scientific article; zbMATH DE number 4211485

Cited in

(41)

• The Complexity of Zero Knowledge
• Zero-knowledge proofs of knowledge for group homomorphisms
• Zero‐Knowledge Proofs
• Languages with efficient zero-knowledge PCPs are in SZK
• Zero-knowledge proofs for committed symmetric Boolean functions
• scientific article; zbMATH DE number 6720551 (Why is no real title available?)
• Direct Zero Knowledge Proofs of Computational Power in Five Rounds
• scientific article; zbMATH DE number 4211485 (Why is no real title available?)
• Efficient proofs of knowledge for threshold relations
• How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• On the impossibility of entropy reversal, and its application to zero-knowledge proofs
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• On Efficient Zero-Knowledge PCPs
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Updatable Zero-Knowledge Databases
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• Composition of zero-knowledge proofs with efficient provers
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• Zero Knowledge and Soundness Are Symmetric
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)
• Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
• Zero-knowledge proofs of proximity
• An Equivalence Between Zero Knowledge and Commitments
• scientific article; zbMATH DE number 1559565 (Why is no real title available?)
• Zero-Knowledge Proofs with Witness Elimination
• Advances in Cryptology - CRYPTO 2003
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Strong batching for non-interactive statistical zero-knowledge
• Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
• Efficient zero-knowledge proof systems
• Scalable zero knowledge with no trusted setup
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Zero-knowledge elementary databases with more expressive queries
• scientific article; zbMATH DE number 2196514 (Why is no real title available?)
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Zero-Knowledge Proofs
• Provably Hard Zero-Way Functions
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting

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)