General properties of quantum zero-knowledge proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4948 LNCS, Issue , 2008, Pages 107-124

  Kobayashi, Hirotada ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; PAPER; PROGRAMMABLE LOGIC CONTROLLERS; STATISTICAL METHODS; STATISTICS;

(E ,2E) THEORY; (PL) PROPERTIES; COMPUTATIONAL ASSUMPTIONS; GENERAL (CO); HEIDELBERG (CO); PROMISE PROBLEMS; SPRINGER (CO); ZERO KNOWLEDGE; ZERO KNOWLEDGE (ZK) PROOF;

CRYPTOGRAPHY;

EID: 40249103101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78524-8_7     Document Type: Conference Paper

References (27)

1. Aharonov, D., Kitaev, A.Yu., Nisan, N.: Quantum circuits with mixed states. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 20-30 (1998)
2. Aiello, W., Håstad, J.: Statistical zero-knowledge languages can be recognized in two rounds. Journal of Computer and System Sciences 42(3), 327-345 (1991)
3. Ben-Aroya, A., Ta-Shma, A.: Quantum expanders and the quantum entropy difference problem. arXiv.org e-Print archive, quant-ph/0702129 (2007)
4. Damgård, I., Fehr, S., Salvail, L.: Zero-knowledge proofs and string commitments withstanding quantum attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 254-272. Springer, Heidelberg (2004)
5. Even, S., Selman, A.L., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Information and Control 61(2), 159-173 (1984)
6. Fortnow, L. J.: The complexity of perfect zero-knowledge. In: Micali, S. (ed.) Randomness and Computation. Advances in Computing Research, vol. 5, pp. 327-343. JAI Press (1989)
7. Goldreich, O.: Foundations of Cryptography - Volume 1 Basic Tools. Cambridge University Press, Cambridge (2001)
8. Goldreich, O.: Zero-knowledge twenty years after its invention. Electronic Colloquium on Computational Complexity, Report No. 63 (2002)
9. Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. Journal of Computer and System. Sciences 60(3), 540-563 (2000)
10. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(3), 691-729 (1991)
11. Goldreich, O., Sahai, A., Vadhan, S.P.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 399-408 (1998)
12. Goldreich, O., Vadhan, S.P.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: Fourteenth Annual IEEE Conference on Computational Complexity, pp. 54 73 (1999)
13. Goldwasser, S., Micali, S., Rackoff, C.W.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1), 186-208 (1989)
14. van de Graaf, J.: Towards a formal definition of security for quantum, protocols. PhD thesis, Département d'Informatique et de Recherche Opérationnelle, Université de Montréal (December 1997)
15. Kitaev, A.Yu., S hen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol. 47. American Mathematical Society (2002)
16. Kitaev, A.Yu., Watrous, J.H.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 608-617 (2000)
17. Kobayashi, IL: Non-interactive quantum perfect and statistical zero-knowledge. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 178-188. Springer, Heidelberg (2003)
18. Kobayashi, H.: General properties of quantum zero-knowledge proofs. arXiv.org e-Print archive, arXiv:0705.1129 [quant-ph] (2007)
19. Marriott, C., Watrous, J.H: Quantum Arthur-Merlin games. Computational Complexity 14(2), 122-152 (2005)
20. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
21. Okamoto, T.: On relationships between statistical zero-knowledge proofs. Journal of Computer and System Sciences 60(1), 47-108 (2000)
22. Sahai, A., Vadhan, S.P.: A complete problem for statistical zero knowledge. Journal of the ACM 50(2), 196-249(2003)
23. Shor, P. W.: Fault-tolerant quantum computation. In: 37th Annual Symposium on Foundations of Computer Science, pp. 56-65 (1996)
24. Vadhan, S.P.: An unconditional study of computational zero-knowledge. SIAM Journal on Computing 36(4), 1160-1214 (2006)
25. Watrous, J.H: Limits on the power of quantum statistical zero-knowledge. In: 43rd Annual Symposium on Foundations of Computer Science, pp. 45-468 (2002)
26. Watrous, J.IL: PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science 292(3), 575-588 (2003)
27. Watrous, J.H.: Zero-knowledge against quantum attacks. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 296-305 (2006)