Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

  title={Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks},
  author={Sean Hallgren and Alexandra Kolla and Pranab Kumar Sen and Shengyu Zhang},
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… 
Witness-Indistinguishability Against Quantum Adversaries 6 . 845 Quantum Complexity Theory – Project Report
This report characterize witness-indistinguishability against quantum adversaries and surveys the main results of research aimed at characterizing what happens to zero-knowledge when quantum adversaries are possible.
Secure Quantum Extraction Protocols
A construction of constant round quantum zero-knowledge argument systems for NP that guarantee security even against quantum malicious verifiers are presented; however, the soundness only holds against classical probabilistic polynomial time adversaries.
Classical Cryptographic Protocols in a Quantum World
The result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world, and shows the existence of classical two- party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions.
General Impossibility of Group Homomorphic Encryption in the Quantum World
This work proves the general impossibility of abelian group homomorphic encryption in the presence of quantum adversaries, when assuming the IND-CPA security notion as the minimal security requirement.
Cryptographic Protocols under Quantum Attacks
This work lies right at the heart of the conflict between highly potential effects but likewise rather demanding conditions in the quantum world.
Quantum Information and Variants of Interactive Proof Systems
The expressive power of quantum interactiveProof systems is exactly PSPACE, the class of problems that can be solved by a polynomial-space deterministic Turing machines and that also admit a classical interactive proof systems, and both the models are equivalent in terms of complexity-theoretic characterization.
Quantum Proofs
An overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define is provided.
Space-efficient Simulations of Quantum Interactive Proofs
This thesis studies the quantum-enhanced version of interactive proof systems, in which each party has access to quantum computing resources and proves a PSPACE upper bound for a variant of QMA(2) that is to date the most general one known in PSPACE.
Isogeny-Based Quantum-Resistant Undeniable Signatures
We propose an undeniable signature scheme based on elliptic curve isogenies, and prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum
This work considers the quantum interactiveProof system model of computation, which is the (classical) interactive proof system model’s natural quantum computational analogue, and concludes that quantum computing provides no increase in computational power whatsoever over classical computing in the context of interactive proof systems.


Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
We show how to transform any interactive proof system which is statistical zero-knowledge with respect to the honest-verifier, into a proof system which is statistical zero-knowledgewith respect to
Limits on the power of quantum statistical zero-knowledge
  • J. Watrous
  • Computer Science, Mathematics
    The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
A definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems is proposed and the resulting complexity class is studied, which is denote QSZK/sub HV/.
A complete problem for statistical zero knowledge
The first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier) is presented, to decide whether two efficiently samplable distributions are either statistically close or far apart.
General Properties of Quantum Zero-Knowledge Proofs
All the four properties above hold also for the statistical zero-knowledge case and the first two properties hold even for the perfect zero- knowledge case, and it is proved that allowing a simulator to output "FAIL" does not change the power of quantum perfect zeroknowledge proofs.
Comparing entropies in statistical zero knowledge with applications to the structure of SZK
  • Oded Goldreich, S. Vadhan
  • Mathematics, Computer Science
    Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
  • 1999
An alternative proof of Okamoto's result by which HVSZK: (i.e., honest-verifier statistical zero knowledge) equals public-coin HVSzK is obtained, and an equivalence of a weak notion of statisticalzero knowledge to the standard one is obtained.
Private coins versus public coins in interactive proof systems
The probabilistic, nondeterministic, polynomial time Turing machine is defined and shown to be equivalent in power to the interactive proof system and to BPP much as BPP is the Probabilistic analog to P.
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs
Zero knowledge with efficient provers
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP witness. Moreover,
Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)
In Crypto93 , Damgard showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the honest verifier can be transformed into
Zero-knowledge proofs of identity
This paper defines the definition of unrestricted input zero- knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever (not even the one bit revealed in zero-knowledge proofs of assertions).