An Unconditional Study of Computational Zero Knowledge

DOI10.1137/S0097539705447207zbMath1129.94037MaRDI QIDQ5757461

Salil P. 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)

Related Items (14)

Two Comments on Targeted Canonical Derandomizers ⋮ Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) ⋮ Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks ⋮ On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ Quantum Commitments from Complexity Assumptions ⋮ Unnamed Item ⋮ General Properties of Quantum Zero-Knowledge Proofs ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ The Complexity of Zero Knowledge ⋮ Unnamed Item ⋮ In a World of P=BPP ⋮ Unnamed Item ⋮ Quantum commitments from complexity assumptions

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