Limits on the power of quantum statistical zero-knowledge

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 459-468

  Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; STATISTICAL METHODS; THEOREM PROVING;

INTERACTIVE PROOF SYSTEMS; POLYNOMIAL ROUND HONEST VERIFIER; QUANTUM STATISTICAL ZERO KNOWLEDGE;

QUANTUM CRYPTOGRAPHY;

EID: 0036948788     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. L. Adleman, J. Demarrais, and M. Huang. Quantum computability. SIAM Journal on Computing, 26(5):1524-1540, 1997.
2. W. Aiello and J. Håstad. Statistical zero-knowledge languages can be recognized in two rounds. Journal of Computer and System Sciences, 42(3):327-345, 1991.
3. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510-1523, 1997.
4. C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, pages 175-179, 1984.
5. K. Cheung and M. Mosca. Decomposing finite Abelian groups. Quantum Information and Computation, 1(3):26-32, 2001.
6. S. Even, A. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2):159-173, 1984.
7. L. Fortnow. The complexity of perfect zero-knowledge. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 327-343. JAI Press, Greenwich, 1989.
8. L. Fortnow and J. Rogers. Complexity limitations on quantum computation. Journal of Computer and System Sciences, 59(2):240-252, 1999.
9. O. Goldreich. Probabilistic proof systems. Technical Report TR94-008, Electronic Colloquium on Computational Complexity, 1994.
10. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer, 1999.
11. O. Goldreich, S. Micali and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691-729, 1991.
12. O. Goldreich, A. Sahai, and S. Vadhan. Honest verifier statistical zero knowledge equals general statistical zero knowledge. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 23-26, 1998.
13. O. Goldreich and S. Vadhan. Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999.
14. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, 1989.
15. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Preliminary version appeared in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 291-304, 1985.
16. J. van de Graaf. Towards a formal definition of security for quantum protocols. PhD thesis, Université de Montréal, 1997.
17. S. Hallgren. Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
18. G. Ivanyos, F. Magniez, and M. Santha. Efficient algorithms for some instances of the non-Abelian hidden subgroup problem. In Thirteenth ACM Symposium on Parallel Algorithms and Architecture, 2001.
19. A. Kitaev. Quantum measurements and the Abelian stabilizer problem. Los Alamos Preprint Archive, quant-ph/9511026, 1995.
20. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 608-617, 2000.
21. D. Mayers. Unconditionally secure quantum bit commitment is impossible. Physical Review Letters, 78:3414-3417, 1997.
22. M. Mosca. Quantum Computer Algorithms. PhD thesis, University of Oxford, 1999.
23. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
24. T. Okamoto. On relationships between statistical zero-knowledge proofs. Journal of Computer and System Sciences. 60(1):47-108, 2000.
25. R. Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 358-376, 1999.
26. A. Sahai and S. Vadhan. A complete promise problem for statistical zero-knowledge. In Proceedings of the 38th Annual Symposium on the Foundations of Computer Science, pages 448-457, 1997. Full version available at http://www.eecs.harvard.edu/~sali/research.html.
27. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1481-1509, 1997.
28. P. Shor and J. Preskill. Simple proof of security of the BB84 quantum key distribution protocol. Physical Review Letters, 85:441-444 (2000).
29. S. Vadhan. A Study of Statistical Zero-Knowledge Proofs. PhD thesis, Massachussetts Institute of Technology, August 1999.
30. J. Watrous. PSPACE has constant-round quantum interactive proof systems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 112-119, 1999.
31. J. Watrous. Quantum algorithms for solvable groups. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 60-67, 2001.