Skip to main content
SpringerLink
Log in

An Unbounded Simulation-Sound Non-interactive Zero-Knowledge Proof System for NP

  • 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

In this paper we use strong one-time signatures schemes and adaptive Non-Interactive Zero-Knowledge (NIZK) proof systems to construct an efficient unbounded simulation-sound NIZK proof system, assuming the existence of one-way permutation and pseudorandom generator. Furthermore, we can obtain an unbounded non-malleable NIZK proof system when replacing the adaptive NIZK proof systems in our construction with adaptive NIZK proof of 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. Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge proofs. SIAM Journal on Computing 20(6), 1084–1118 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceeding of the 19th annual Symposium on Theory of computing, pp. 103–112 (1988)

    Google Scholar 

  3. De Santis, A., Di Crescenzo, G., Ostrovsky, R., et al.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566–598. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM Journal on Computing 30(2), 391–437 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proceeding of the 30th Annual Symposium on Theory of Computing, pp. 409–418 (1998)

    Google Scholar 

  6. De Santis, A., Persiano, G.: Zero-knowledge proofs of knowledge without interaction. In: Proceeding of the 33th Annual Symposium on Foundations of Computer Science, pp. 427–436 (1992)

    Google Scholar 

  7. Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on single random string. In: Proceeding of the 31th Annual Symposium on Foundations of Computer Science, vol. I, pp. 308–317 (1990)

    Google Scholar 

  8. Goldreich, O.: Foundation of cryptography. Draft of a chapter on encryption schenes, vol. 2, http://www.wisdom.weizmann.ac.il/

  9. Goldreich, O.: Foundation of cryptography - basic tools. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  10. Goldreich, O.: Secure multi-party computation, http://www.wisdom.weizmann.ac.il

  11. Goldreich, O.: Zero-knowledge twenty years after its invention. Technical Report, http://citeseer.ist.psu.edu/goldreich02zeroknowledge.html

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Goldreich, O., Micali, S., Wogderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceeding of the 19th annual Symposium on Theory of computing, pp. 218–229 (1987)

    Google Scholar 

  14. Goldreich, O., Micali, S., Wogderson, A.: Proofs that yoeld nothing but their validity or all languages in NP have zero-knowledge proofs systems. Journal of ACM 38(3), 691–729 (1991)

    Article  MATH  Google Scholar 

  15. Garay, J.A., Mackenzie, P., Yang, K.: Strengthing zero-knowledge protocols using signatures. In: EUROCTRYPT 2003, pp. 177–194 (2003)

    Google Scholar 

  16. Lindell, Y.: A simpler construction of CCA2-secure public-key encryption under general assumptions, http://eprint.iacr.org/2002/057.pdf

  17. Mackenzie, P., Yang, K.: On simulation-sound trapdoor commitments, http://eprint.iacr.org/2003/352.pdf

  18. Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: Proceeding of the 40th Annual Symposium on Foundations of Computer Science, pp. 543–553 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing, 100039, China

    Hongda Li & Bao Li

Authors
  1. Hongda Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bao Li
    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

Li, H., Li, B. (2005). An Unbounded Simulation-Sound Non-interactive Zero-Knowledge Proof System for NP. 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_18

Download citation

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

  • 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