Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

Authors:
Sean Hallgren;Alexandra Kolla;Pranab Sen;Shengyu Zhang
Affiliations:
Pennsylvania State University, University Park, U.S.A.;U C Berkeley, Berkeley, U.S.A.;Tata Institute of Fundamental Research, Mumbai, India;California Institute of Technology, Pasadena, U.S.A.
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 15
Cited 3

Zero-knowledge proofs of identity

Journal of Cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
A complete problem for statistical zero knowledge

Journal of the ACM (JACM)
imits on the Power of Quantum Statistical Zero-Knowledge

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Direct Minimum-Knowledge Computations

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Zero knowledge with efficient provers

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero-knowledge against quantum attacks

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Foundations of Cryptography: Volume 1

Foundations of Cryptography: Volume 1
An Unconditional Study of Computational Zero Knowledge

SIAM Journal on Computing
General properties of quantum zero-knowledge proofs

TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments

TCC'08 Proceedings of the 5th conference on Theory of cryptography

Quantum-Secure Coin-Flipping and Applications

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Classical cryptographic protocols in a quantum world

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
QIP = PSPACE

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against all classical and quantum polynomial time verifiers, even cheating ones. Here we refer to the generalized notion of zero-knowledge with classical and quantum auxiliary inputs respectively.Our condition on the original protocol is that, for positive instances of the problem, the simulated message transcript should be quantum computationally indistinguishable from the actual message transcript. This is a natural strengthening of the notion of honest verifier computational zero-knowledge, and includes in particular, the complexity class of honest verifier statistical zero-knowledge. Our result answers an open question of Watrous [Wat06], and generalizes classical results by Goldreich, Sahai and Vadhan [GSV98], and Vadhan [Vad06] who showed that honest verifier statistical, respectively computational, zero knowledge is equal to general statistical, respectively computational, zero knowledge.