The complexity of promise problems with applications to public-key cryptography
Information and Control
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Statistical zero-knowledge languages can be recognized in two rounds
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
Journal of Computer and System Sciences
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
imits on the Power of Quantum Statistical Zero-Knowledge
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
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
Classical and Quantum Computation
Classical and Quantum Computation
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Towards a formal definition of security for quantum protocols
Towards a formal definition of security for quantum protocols
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
Computational Complexity
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Proceedings of the forty-second ACM symposium on Theory of computing
Journal of the ACM (JACM)
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Hi-index | 0.01 |
This paper studies general properties of quantum zeroknowledge proof systems. Among others, the following properties are proved on quantum computational zero-knowledge proofs: - Honest-verifier quantum zero-knowledge equals general quantum zero-knowledge. - Public-coin quantum zero-knowledge equals general quantum zeroknowledge. - Quantum zero-knowledge with perfect completeness equals general quantum zero-knowledge with imperfect completeness. - Any quantum zero-knowledge proof system can be transformed into a three-message public-coin quantum zero-knowledge proof system of perfect completeness with polynomially small error in soundness (hence with arbitrarily small constant error in soundness). All the results proved in this paper are unconditional, i.e., they do not rely any computational assumptions. The proofs for all the statements are direct and do not use complete promise problems, and thus, essentially the same method works well even for quantum statistical and perfect zero-knowledge proofs. In particular, all the four properties above hold also for the statistical zero-knowledge case (the first two were shown previously by Watrous), and the first two properties hold even for the perfect zero-knowledge case. It is also proved that allowing a simulator to output "FAIL" does not change the power of quantum perfect zeroknowledge proofs. The corresponding properties are not known to hold in the classical perfect zero-knowledge case.