Zero-knowledge against quantum attacks

SIAM Journal on Computing

Volumn 39, Issue 1, 2009, Pages 25-58

  Watrous, John ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Interactive proof systems; Quantum cryptography; Zero knowledge

Indexed keywords

3-COLORING; COMMITMENT SCHEME; COMMON REFERENCE STRING MODELS; COMPLETE PROBLEMS; COMPLEXITY CLASS; GRAPH ISOMORPHISM; INTERACTIVE PROOF SYSTEM; INTERACTIVE PROOF SYSTEMS; OF QUANTUM-INFORMATION; QUANTUM INTERACTIVE PROOF SYSTEMS; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE; ZERO-KNOWLEDGE PROTOCOLS;

COMPUTATION THEORY; QUANTUM CRYPTOGRAPHY; QUANTUM OPTICS; SET THEORY;

PROGRAMMABLE LOGIC CONTROLLERS;

EID: 67650135522     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060670997     Document Type: Conference Paper

References (46)

1. M. ADCOCK AND R. CLEVE, A quantum Goldreich-Levin theorem with cryptographic applications, in Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 2285, Springer-Verlag, New York, 2002, pp. 323-334.
2. D. AHARONOV, A. KITAEV, AND N. NISAN, Quantum circuits with mixed states, in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 20-30.
3. S. ARORA AND B. BARAK, Complexity Theory: A Modern Approach, http://www.cs.princeton.edu/theory/complexity/ (2006).
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, IEEE Computer Society, Los Alamitos, CA, 1984, pp. 175-179.
5. R. BHATIA, Matrix Analysis, Springer-Verlag, New York, 1997.
6. M. BOYER, G. BRASSARD, P. Høyer, AND A. TAPP, Tight bounds on quantum searching, Fortsch. Phys., 46 (1998), pp. 493-505.
7. G. BRASSARD, D. CHAUM, AND C. CRÉPEAU, Minimum disclosure proofs of knowledge, J. Comput. System Sci., 37 (1988), pp. 156-189.
8. G. BRASSARD, P. Høyer, M. MOSCA, AND A. TAPP, Quantum amplitude amplification and estimation, in Quantum Computation and Quantum Information: A Millennium Volume, Contemp. Math. 305, AMS, Providence, RI, 2002, pp. 53-74.
9. I. DAMGÅRD, S. FEHR, AND L. SALVAIL, Zero-knowledge proofs and string commitments withstanding quantum attacks, in Advances in Cryptology - CRYPTO 2004: 24th Annual International Cryptology Conference, Lecture Notes in Comput. Sci. 3152, Springer-Verlag, New York, 2004, pp. 254-272.
10. S. EVEN, A. SELMAN, AND Y. YACOBI, The complexity of promise problems with applications to public-key cryptography, Inform. and Control, 61 (1984), pp. 159-173.
11. C. FUCHS AND A. PERES, Quantum-state disturbance versus information gain: Uncertainty relations for quantum information, Phys. Rev. A (3), 53 (1996), pp. 2038-2045.
12. C. FUCHS AND J. VAN DE GRAAF, Cryptographic distinguishability measures for quantum-mechanical states, IEEE Trans. Inform. Theory, 45 (1999), pp. 1216-1227.
13. O. GOLDREICH, Foundations of Cryptography: Volume 1 - Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
14. O. GOLDREICH, On Promise Problems (a Survey in Memory of Shimon Even [1935-2004]), Electronic Colloquium on Computational Complexity, Report TR05-018, 2005.
15. O. GOLDREICH AND S. GOLDWASSER, On the limits of nonapproximability of lattice problems, J. Comput. System Sci., 60 (2000), pp. 540-563.
16. O. GOLDREICH AND H. KRAWCZYK, On the composition of zero-knowledge proof systems, SIAM J. Comput., 25 (1996), pp. 169-192.
17. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J. Assoc. Comput. Mach., 38 (1991), pp. 691-729.
18. 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, ACM, New York, 1998, pp. 23-26.
19. 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, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 54-73.
20. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-208.
21. J. VAN DE GRAAF, Towards a Formal Definition of Security for Quantum Protocols, Ph.D. thesis, Université de Montréal, Montreal, Canada, 1997.
22. L. GROVER, A fast quantum mechanical algorithm for database search, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 212-219.
23. L. GROVER, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett., 79 (1997), pp. 325-328.
24. J. HÅSTAD, R. IMPAGLIAZZO, L. A. LEVIN, AND M. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
25. C. JORDAN, Essai sur la géométriè a n dimensions, Bull. Soc. Math. France, 3 (1875), pp. 103-174.
26. A. KITAEV, Quantum computations: Algorithms and error correction, Russian Math. Surveys, 52 (1997), pp. 1191-1249.
27. A. KITAEV, A. SHEN, AND M. VYALYI, Classical and Quantum Computation, Grad. Stud. Math. 47, AMS, Providence, RI, 2002.
28. 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, ACM, New York, 2000, pp. 608-617.
29. H. KOBAYASHI, Non-interactive quantum perfect and statistical zero-knowledge, in ISAAC 2003: Proceedings of the 14th International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 2906, Springer-Verlag, New York, 2003, pp. 178-188.
30. H.-K. LO AND H. F. CHAU, IS quantum bit commitment really possible?, Phys. Rev. Lett., 78 (1997), pp. 3410-3413.
31. C. MARRIOTT AND J. WATROUS, Quantum Arthur-Merlin games, Comput. Complexity, 14 (2005), pp. 122-152.
32. K. MATSUMOTO, A Simpler Proof of Zero-Knowledge against Quantum Attacks Using Grover's Amplitude Amplification, http://arxiv.org/ abs/quant-ph/0602186 (2006).
33. D. MAYERS, Unconditionally secure quantum bit commitment is impossible, Phys. Rev. Lett., 78 (1997), pp. 3414-3417.
34. D. MAYERS, Unconditional security in quantum cryptography, J. ACM, 48 (2001), pp. 351-406.
35. C. MOORE, A. RUSSELL, AND U. VAZIRANI, A Classical One-Way Function to Confound Quantum Adversaries, http://arxiv.org/abs/quant-ph/0701115 (2007).
36. M. NAOR, Bit commitment using pseudorandomness, J. Cryptology, 4 (1991), pp. 151-158.
37. M. A. NIELSEN AND I. L. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
38. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
39. O. REGEV, private communication, 2006.
40. R. L. RIVEST, A. SHAMIR, AND L. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), pp. 120-126.
41. A. SAHAI AND S. VADHAN, A complete promise problem for statistical zero-knowledge, J. ACM, 50 (2003), pp. 196-249.
42. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
43. P. SHOR AND J. PRESKILL, Simple proof of security of the BB84 quantum key distribution protocol, Phys. Rev. Lett., 85 (2000), pp. 441-444.
44. J. WATROUS, Limits on the power of quantum statistical zero-knowledge, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 459-468.
45. J. WATROUS, Zero-knowledge against quantum attacks, in Proceedings of the 38th ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 296-305.
46. W. WOOTTERS AND W. ZUREK, A single quantum cannot be cloned, Nature, 299 (1982), pp. 802-803.