Skip to main content
SpringerLink
Log in

A Gentle Introduction to Zero-Knowledge

  • Conference paper
  • First Online:
Book cover ICT Innovations 2021. Digital Transformation (ICT Innovations 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1521))

Included in the following conference series:

  • 389 Accesses

Abstract

Zero-knowledge proofs, invented in the 1980s, allow one to certify the validity of a statement without revealing why it is true. I illustrate their relevance to secure identification, blockchain privacy, and electronic voting. I also discuss their generality and composability.

This article was written while visiting the Simons Institute for the Theory of Computing at UC Berkeley.

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

Access this chapter

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Institutional subscriptions

Notes

  1. 1.

    A minor technical difference is that the example of Goldreich et al. concerns isomorphism of graphs while ours is about isomorphism of matrices, i.e., bipartite graphs.

References

  1. Abe, M., Ambrona, M., Bogdanov, A., Okhubo, M., Rosen, A.: Acyclicity programming for sigma-protocols. In: TCC 2021: Theory of Cryptography (2021, to appear)

    Google Scholar 

  2. Abe, M., Ohkubo, M., Suzuki, K.: 1-out-of-n signatures from a variety of keys. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 415–432. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36178-2_26

    Chapter  Google Scholar 

  3. Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084–1118 (1991)

    Article  MathSciNet  Google Scholar 

  4. Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390–420. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-48071-4_28

    Chapter  Google Scholar 

  5. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48658-5_19

    Chapter  Google Scholar 

  6. Damgård, I., Groth, J., Salomonsen, G.: The theory and implementation of an electronic voting system. In: Gritzalis, D.A. (ed.) Secure Electronic Voting, pp. 77–99. Springer, Boston (2003). https://doi.org/10.1007/978-1-4615-0239-5_6

    Chapter  Google Scholar 

  7. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265–284. Springer, Heidelberg (2006). https://doi.org/10.1007/11681878_14

    Chapter  Google Scholar 

  8. Feige, U., Lapidot, D., Shamir, A.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1–28 (1999)

    Article  MathSciNet  Google Scholar 

  9. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)

    Article  MathSciNet  Google Scholar 

  10. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. J. ACM 38(3), 690–728 (1991)

    Article  MathSciNet  Google Scholar 

  11. Goldreich, O.: Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, Cambridge (2006)

    MATH  Google Scholar 

  12. Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, Cambridge (2009)

    MATH  Google Scholar 

  13. Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103–112 (2016)

    Article  Google Scholar 

  14. Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, New York (1990). https://doi.org/10.1007/0-387-34805-0_22

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering and Institute of Theoretical Computer Science and Communications, The Chinese University of Hong Kong, Shatin, Hong Kong

    Andrej Bogdanov

Authors
  1. Andrej Bogdanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrej Bogdanov .

Editor information

Editors and Affiliations

  1. Ss. Cyril and Methodius University in Skopje, Skopje, North Macedonia

    Ljupcho Antovski

  2. Ss. Cyril and Methodius University in Skopje, Skopje, North Macedonia

    Goce Armenski

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bogdanov, A. (2022). A Gentle Introduction to Zero-Knowledge. In: Antovski, L., Armenski, G. (eds) ICT Innovations 2021. Digital Transformation. ICT Innovations 2021. Communications in Computer and Information Science, vol 1521. Springer, Cham. https://doi.org/10.1007/978-3-031-04206-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-04206-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-04205-8

  • Online ISBN: 978-3-031-04206-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation