Zero knowledge with efficient provers

DOI10.1145/1132516.1132559zbMath1301.94124MaRDI QIDQ2931393

Minh-Huyen Nguyen, Salil P. 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 complexity; cryptography; zero-knowledge; language-dependent commitment schemes

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

94A60: Cryptography

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

94A62: Authentication, digital signatures and secret sharing

Related Items

Zero-Knowledge Proofs of Proximity, How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge, An Equivalence Between Zero Knowledge and Commitments, The Complexity of Zero Knowledge, Interactive Hashing: An Information Theoretic Tool (Invited Talk), Adaptive zero-knowledge proofs and adaptively secure oblivious transfer, Public-coin statistical zero-knowledge batch verification against malicious verifiers, How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge, Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks