Skip to main content
SpringerLink
Log in

You Can Prove So Many Things in Zero-Knowledge

  • Conference paper
Information Security and Cryptology (CISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3822))

Included in the following conference series:

Abstract

We present a short survey of known notions of zero- knowledge proof systems in the interactive model and main results about these notions. We then introduce a new notion,an extension of proofs of knowledge,which we call Proofs of Non-Zero Knowledge, as they allow a prover to convince a verifier that he knows a secret satisfying some relation, without revealing any new information about the secret or even the relation that the secret satifies with the common input. We prove a number of basic results about proofs of non-zero knowledge, and, in the process, revisit previously studied protocols, described as ‘proofs of partial knowledge’, which are particular cases of proofs of non-zero knowledge.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001 (2001)

    Google Scholar 

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

    Google Scholar 

  3. Barak, B., Goldreich, O.: Universal Arguments and Their Applications. In: Proc. of IEEE Conference on Computational Complexity 2002 (2002)

    Google Scholar 

  4. Bellare, M., Goldreich, O.: Proving Computational Ability, manuscript (1992)

    Google Scholar 

  5. Ben-Or, M., Goldreich, O., Goldwasser, S., Håstad, J., Kilian, J., Micali, S., Rogaway, P.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37–56. Springer, Heidelberg (1990)

    Google Scholar 

  6. Blum, M.: How to Prove a Theorem So No One Else Can Claim It. In: Proc. of the International Congress of Mathematicians, Berkeley, California (1986)

    Google Scholar 

  7. Boppana, R., Hastad, J., Zachos, S.: Does co-NP has Short Interactive Proofs? Information Processing Letters 25, 127–132 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Brassard, G., Crépeau, C., Chaum, D.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences 37(2), 156–189

    Google Scholar 

  9. Cramer, R., Damgard, I., MacKenzie, P.: Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 354–373. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Cramer, R., Damgard, I., Schoenmakers, B.: Proof 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)

    Google Scholar 

  11. Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-authority secret-ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 72–83. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  12. De Santis, A., Di Crescenzo, G., Persiano, G.: Secret sharing and perfect zero-knowledge. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 73–84. Springer, Heidelberg (1994)

    Google Scholar 

  13. De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: Proc. of the 35th IEEE Symposium on Foundations of Computer Science, FOCS 1994 (1994)

    Google Scholar 

  14. Di Crescenzo, G., Impagliazzo, R.: Security-Preserving Hardness Amplification for any Regular One-Way Function. In: Proc. of STOC 1999 (1999)

    Google Scholar 

  15. Di Crescenzo, G., Sakurai, K., Yung, M.: Zero-Knowledge Proofs of Decision Power: New Protocols and Optimal Round-Complexity. In: Proc. of ICICS 1998 (1998)

    Google Scholar 

  16. Di Crescenzo, G., Sakurai, K., Yung, M.: On Zero-Knowledge Proofs: ‘From Membership to Decision. In: Proc. of the 2000 ACM Symposium on Theory of Computing, STOC 2000 (2000)

    Google Scholar 

  17. Feige, U., Fiat, A., Shamir, A.: Zero-Knowledge Proofs of Identity. Journal of Cryptology 1, 77–94 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  18. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Google Scholar 

  19. Fortnow, L.: The Complexity of Perfect Zero Knowledge. In: Proc. of the 1987 ACM Symposium on Theory of Computing, STOC 1987 (1987)

    Google Scholar 

  20. Franklin, M., Sander, T.: Commital deniable proofs and electronic campaign finance. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, p. 373. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Galil, Z., Haber, S., Yung, M.: Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM Journal on Computing 18(4)

    Google Scholar 

  22. Garay, J., MacKenzie, P.: Concurrent Oblivious Transfer. In: Proc. of the 41st IEEE Symposium on Foundations of Computer Science, FOCS 2000 (2000)

    Google Scholar 

  23. 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(1), 691–729 (1991)

    MATH  MathSciNet  Google Scholar 

  24. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing 18(1) (1989)

    Google Scholar 

  25. Impagliazzo, R., Yung, M.: Direct minimum knowledge computations. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 40–51. Springer, Heidelberg (1988)

    Google Scholar 

  26. Itoh, T., Ohta, Y., Shizuya, H.: A Language-Dependent Cryptographic Primitive. Journal of Cryptology 10(1), 37–49 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  27. Shamir, A.: IP=PSPACE. In: Proc. of the 31st IEEE Symposium on Foundations of Computer Science, FOCS 1990 (1990)

    Google Scholar 

  28. Tompa, M., Woll, H.: Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information. In: Proc. of IEEE FOCS 1987 (1987)

    Google Scholar 

  29. Yung, M.: Zero-knowledge proofs of computational power. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 196–207. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  30. Zhao, Y., Lee, C.H., Zhao, Y., Zhu, H.: Some observations on zap and its applications. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 180–193. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telcordia Technologies, Piscataway, NJ, 08854, USA

    Giovanni Di Crescenzo

Authors
  1. Giovanni Di Crescenzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. State Key Laboratory of Information Security, Institution of Software of Chinese Academy of Sciences, 100080, Beijing, China

    Dengguo Feng

  2. SKLOIS Lab, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Dongdai Lin

  3. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Crescenzo, G. (2005). You Can Prove So Many Things in Zero-Knowledge. In: Feng, D., Lin, D., Yung, M. (eds) Information Security and Cryptology. CISC 2005. Lecture Notes in Computer Science, vol 3822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599548_2

Download citation

  • DOI: https://doi.org/10.1007/11599548_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30855-3

  • Online ISBN: 978-3-540-32424-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation