Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2003: Algorithms and Computation pp 178–188Cite as

Non-interactive Quantum Perfect and Statistical Zero-Knowledge

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2906))

Abstract

This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the complexity class resulting from non-interactive quantum perfect zero-knowledge proof systems of perfect completeness has a natural complete promise problem. Using our complete promise problem, the Graph Non-Automorphism problem is shown to have a non-interactive quantum perfect zero-knowledge proof system.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge. SIAM Journal on Computing 20(6), 1084–1118 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blum, M., Feldman, P., Mical, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 103–112 (1988)

    Google Scholar 

  3. De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: Image density is complete for non-interactive-SZK (extended abstract). In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 784–795. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge proof systems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 52–72. Springer, Heidelberg (1987)

    Google Scholar 

  5. De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge with preprocessing. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 269–282. Springer, Heidelberg (1988)

    Google Scholar 

  6. 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)

    Article  MATH  MathSciNet  Google Scholar 

  7. Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. Journal of Cryptology 7(1), 1–32 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Google Scholar 

  9. Goldreich, O., Sahai, A., Vadhan, S.P.: Can statistical zero knowledge be made non-interactive? or on the relationship of SZK and NISZK. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 467–484. Springer, Heidelberg (1999)

    Google Scholar 

  10. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1), 186–208 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Google Scholar 

  12. Gruska, J.D.: Quantum Computing. McGraw-Hill, New York (1999)

    Google Scholar 

  13. Hughston, L.P., Jozsa, R.O., Wootters, W.K.: A complete classification of quantum ensembles having a given density matrix. Physics Letters A 183, 14–18 (1993)

    Article  MathSciNet  Google Scholar 

  14. Kilian, J., Petrank, E.: An efficient noninteractive zero-knowledge proof system for NP with general assumptions. Journal of Cryptology 11(1), 1–27 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol. 47. American Mathematical Society, Providence (2002)

    MATH  Google Scholar 

  16. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  17. Sahai, A., Vadhan, S.P.: A complete problem for statistical zero knowledge. Journal of the ACM 50(2), 196–249 (2003)

    Article  MathSciNet  Google Scholar 

  18. Uhlmann, A.: Parallel transport and “quantum holonomy” along density operators. Reports on Mathematical Physics 24, 229–240 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  19. Vadhan, S.P.: A Study of Statistical Zero-Knowledge Proofs. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology (August 1999)

    Google Scholar 

  20. Watrous, J.H.: Succinct quantum proofs for properties of finite groups. In: 41st Annual Symposium on Foundations of Computer Science, pp. 537–546 (2000)

    Google Scholar 

  21. Watrous, J.H.: Limits on the power of quantum statistical zero-knowledge. In: 43rd Annual Symposium on Foundations of Computer Science, pp. 459–468 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Quantum Computation and Information Project, Exploratory Research for Advanced Technology, Japan Science and Technology Corporation, 5-28-3 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hirotada Kobayashi

Authors
  1. Hirotada Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashi, H. (2003). Non-interactive Quantum Perfect and Statistical Zero-Knowledge. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation