Zero knowledge with efficient provers

DOI10.1145/1132516.1132559zbMath1301.94124OpenAlexW2119602408MaRDI 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 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)

Related Items (10)

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ 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 ⋮ How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge ⋮ The Complexity of Zero Knowledge ⋮ Strong batching for non-interactive statistical zero-knowledge ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ Interactive Hashing: An Information Theoretic Tool (Invited Talk)

This page was built for publication: Zero knowledge with efficient provers