An Unconditional Study of Computational Zero Knowledge

DOI10.1137/S0097539705447207MaRDI QIDQ5757461zbMATH OpenFDO

Authors Salil Vadhan

Publication date 7 September 2007

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

computational complexityone-way functionzero-knowledge proofpromise problemstatistical zero-knowledge proofclass of problems

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On relationships between statistical zero-knowledge proofs
• Zero Knowledge and Soundness Are Symmetric
• Definitions and properties of zero-knowledge proof systems
• scientific article; zbMATH DE number 1256785
• A complete problem for statistical zero knowledge

Cited in

(27)

• Zero knowledge with efficient provers
• Quantum commitments from complexity assumptions
• On Monotone Formula Composition of Perfect Zero-Knowledge Languages
• A complete problem for statistical zero knowledge
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
• Quantum commitments from complexity assumptions
• An Equivalence Between Zero Knowledge and Commitments
• From weak to strong zero-knowledge and applications
• Zero Knowledge and Soundness Are Symmetric
• scientific article; zbMATH DE number 7561748 (Why is no real title available?)
• In a world of \(\mathrm{P}=\mathrm{BPP}\)
• The Complexity of Zero Knowledge
• SZK Proofs for Black-Box Group Problems
• scientific article; zbMATH DE number 697825 (Why is no real title available?)
• On nonadaptive reductions to the set of random strings and its dense subsets
• Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
• Fidelity of quantum strategies with applications to cryptography
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds
• Unconditionally secure commitments with quantum auxiliary inputs
• Capturing one-way functions via NP-hardness of meta-complexity
• Brief announcement: Zero-knowledge protocols for search problems
• A framework for non-interactive instance-dependent commitment schemes (NIC)
• Two Comments on Targeted Canonical Derandomizers
• General Properties of Quantum Zero-Knowledge Proofs
• Composition of zero-knowledge proofs with efficient provers
• scientific article; zbMATH DE number 7204388 (Why is no real title available?)

This page was built for publication: An Unconditional Study of Computational Zero Knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757461)