Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2003: Advances in Cryptology — EUROCRYPT 2003 pp 123–139Cite as

  1. Home
  2. Advances in Cryptology — EUROCRYPT 2003
  3. Conference paper
Resettable Zero-Knowledge in the Weak Public-Key Model

Resettable Zero-Knowledge in the Weak Public-Key Model

  • Yunlei Zhao5,7,
  • Xiaotie Deng6,
  • C. H. Lee6 &
  • …
  • Hong Zhu7 
  • Conference paper
  • First Online: 01 January 2003
  • 3516 Accesses

  • 11 Citations

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

Abstract

A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and Reyzin [EuroCrypt’01, pp. 373–393], is introduced and is named weak public-key (WPK) model. The motivations and applications of the WPK model are justified in the distributed smart-card/server setting and it seems more preferable in practice, especially in E-commerce over Internet. In this WPK model a 3-round (optimal) black-box resettable zero-knowledge argument with concurrent soundness for \( \mathcal{N}\mathcal{P} \) is presented assuming the security of RSA with large exponents against subexponential-time adversaries. Our result improves Micali and Reyzin’s result of resettable zero-knowledge argument with concurrent soundness for \( \mathcal{N}\mathcal{P} \) in the UPK model. Note that although Micali and Reyzin’ protocol satisfies concurrent soundness in the UPK model, but it does not satisfy even sequential soundness in our WPK model.

Our protocol works in a somewhat “parallel repetition” manner to reduce the error probability and the black-box zero-knowledge simulator works in strict polynomial time rather than expected polynomial time. The critical tools used are: verifiable random functions introduced by Micali, Rabin and Vadhan [FOCS’99, pp. 120–130], zap presented by Dwork and Naor [FOCS’00, pp. 283–293] and complexity leveraging introduced by Canetti, Goldreich, Goldwasser and Micali [STOC’00, pp. 235–244].

Keywords

  • Smart Card
  • Security Parameter
  • Commitment Scheme
  • Common Input
  • Pseudorandom Function

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. In IEEE Symposium on Foundations of Computer Science, pages 106–115, 2001.

    Google Scholar 

  2. M. Blum, A. D. Santis, S. Micali and G. Persiano. Non-interactive Zero-Knowledge. SIAM Journal on Computing, 20(6): 1084–1118, 1991.

    CrossRef  MATH  MathSciNet  Google Scholar 

  3. M. Bellare, M. Fischlin, S. Goldwasser and S. Micali. Identification protocols secure against reset attacks. In B. Pfitzmann (Ed.): Advances in Cryptology-Proceedings of EUROCRYPT 2001, LNCS 2045, pages 495–511. Springer-Verlag, 2001.

    CrossRef  Google Scholar 

  4. M. Blum, P. Feldman and S. Micali. Non-interactive Zero-Knowledge and Its Applications. In ACM Symposium on Theory of Computing, pages 103–112, 1988.

    Google Scholar 

  5. M. Bellare, R. Impagliazzo and M. Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols. In IEEE Symposium on Foundations of Computer Science, pages 374–383, 1997.

    Google Scholar 

  6. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In ACM Symposium on Theory of Computing, pages 484–493, 2002.

    Google Scholar 

  7. R. Cramer and I. Damgard. Linear Zero-knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments. In ACM Symposium on Theory of Computing, pages 436–445, 1997.

    Google Scholar 

  8. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable Zero-Knowledge. In ACM Symposium on Theory of Computing, pages 235–244, 2000.

    Google Scholar 

  9. R. Canetti, J. Kilian, E. Petrank and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires \( \tilde \Omega \) Rounds. In ACM Symposium on Theory of Computing, pages 570–579, 2001.

    Google Scholar 

  10. A. D. Santis, G. D. Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-Interactive Zero-Knowledge. In J. Kilian (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2001, LNCS 2139, pages 566–598. Springer-Verlag, 2001.

    Google Scholar 

  11. C. Dwork and M. Naor. Zaps and Their Applications. In IEEE Symposium on Foundations of Computer Science, pages 283–293, 2000.

    Google Scholar 

  12. C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In ACM Symposium on Theory of Computing, pages 409–418, 1998.

    Google Scholar 

  13. C. Dwork and L. Stockmeyer. 2-Round Zero-Knowledge and Proof Auditors. In ACM Symposium on Theory of Computing, pages 322–331, 2002.

    Google Scholar 

  14. U. Feige, A. Fiat and A. Shamir. Zero-knowledge Proof of Identity. Journal of Cryptology, 1(2): 77–94, 1988.

    CrossRef  MATH  MathSciNet  Google Scholar 

  15. U. Feige, D. Lapidot and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Under General Assumptions. SIAM Journal on Computing, 29(1): 1–28, 1999.

    CrossRef  MATH  MathSciNet  Google Scholar 

  16. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In A. Odlyzko (Ed.): Advances in Cryptology-Proceedings of CRYPTO’86, LNCS 263, pages 186–194. Springer-Verlag, 1986.

    Google Scholar 

  17. O. Goldreich. Foundation of Cryptography-Basic Tools. Cambridge University Press, 2001.

    Google Scholar 

  18. S. Goldwasser and M. Bellare. Lecture Notes on Cryptography. 2001.

    Google Scholar 

  19. O. Goldreich, S. Goldwasser and S. Micali. How to Construct Random Functions. Journal of the Association for Computing Machinery, 33(4):792–807, 1986.

    MathSciNet  Google Scholar 

  20. O. Goldreich and H. Krawczky. On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, 25(1): 169–192, 1996.

    CrossRef  MATH  MathSciNet  Google Scholar 

  21. J. Kilian, E. Petrank. An Efficient Non-Interactive Zero-Knowledge Proof System for \( \mathcal{N}\mathcal{P} \) with General Assumptions. Journal of Cryptology, 11(2): 24, 1998.

    MathSciNet  Google Scholar 

  22. J. Kilian, E. Petrank, R. Richardson. Concurrent and Resettable Zero-Knowledge in Poly-Logarithmic Rounds. In ACM Symposium on Theory of Computing, pages 560–569, 2001.

    Google Scholar 

  23. A. Lysyanskaya. Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. In M. Yung (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2002, LNCS 2442, pages 597–612. Springer-Verlag, 2002.

    Google Scholar 

  24. S. Micali and L. Reyzin. Soundness in the Public-Key Model. In J. Kilian (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2001, LNCS 2139, pages 542–565. Springer-Verlag, 2001.

    Google Scholar 

  25. S. Micali and L. Reyzin. Min-Round Resettable Zero-Knowledge in the Public-Key Model. In B. Pfitzmann (Ed.): Advances in Cryptology-Proceedings of EUROCRYPT 2001, LNCS 2045, pages 373–393. Springer-Verlag, 2001.

    CrossRef  Google Scholar 

  26. S. Micali, M. Rabin and S. Vadhan. Verifiable Random Functions. In IEEE Symposium on Foundations of Computer Science, pages 120–130, 1999.

    Google Scholar 

  27. L. Reyzin. Zero-Knowledge with Public Keys. Ph. D Thesis, MIT, 2001.

    Google Scholar 

  28. R. Richardson and J. Killian. On the Concurrent Composition of Zero-Knowledge Proofs. In J. Stern (Ed.): Advances in Cryptology-Proceedings of EUROCRYPT 1999, LNCS 1592, pages 415–423. Springer-Verlag, 1999.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software School, Fudan University, Shanghai, China

    Yunlei Zhao

  2. Department of Computer Science, City University of Hong Kong, Hong Kong

    Xiaotie Deng & C. H. Lee

  3. Department of Computer Science, Fudan University, Shanghai, China

    Yunlei Zhao & Hong Zhu

Authors
  1. Yunlei Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaotie Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. H. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technion — Israel Institute of Technology, Haifa, 32000, Israel

    Eli Biham

Rights and permissions

Reprints and Permissions

Copyright information

© 2003 International Association for Cryptologic Research

About this paper

Cite this paper

Zhao, Y., Deng, X., Lee, C.H., Zhu, H. (2003). Resettable Zero-Knowledge in the Weak Public-Key Model. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_8

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/3-540-39200-9_8

  • Published: 13 May 2003

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14039-9

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

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature