Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

DOI10.1007/978-3-540-78524-8_28zbMath1162.94345OpenAlexW1828812675MaRDI QIDQ5445523

Iordanis Kerenidis, Dragos Florin Ciocan, André Chailloux, Salil P. Vadhan

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_28

zbMATH Keywords

computational complexitycryptographycommitment schemesArthur-Merlin gamesnoninteractive zero-knowledge proofsquantum zero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ Zero knowledge and circuit minimization ⋮ Statistical difference beyond the polarizing regime ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Generalized Quantum Arthur--Merlin Games ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

This page was built for publication: Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model