Advertisement

A New Notion of Soundness in Bare Public-Key Model

  • Shirley H. C. Cheung
  • Xiaotie Deng
  • C. H. Lee
  • Yunlei Zhao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2576)

Abstract

A new notion of soundness in bare public-key (BPK) model is presented. This new notion just lies in between one-time soundness and sequential soundness and its reasonableness is justified in the context of resettable zero-knowledge when resettable zero-knowledge prover is implemented by smart card.

Keywords

Smart Card Security Parameter False Statement 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boaz Barak, Oded Goldreich, Shafi Goldwasser, and Yehuda Lindell. Resettably-Sound Zero-Knowledge and its Applications. In IEEE Symposium on Foundations of Computer Science, pages 116–125, 2001.Google Scholar
  2. 2.
    Mihir Bellare, Marc Fischlin, Shafi Goldwasser, and Silvio Micali. Identification Protocols Secure against Reset Attacks. In B. Pfitzmann (Ed.): EUROCRYPT 2001, LNCS 2045, pages 495–511. Springer-Verlag, 2001.CrossRefGoogle Scholar
  3. 3.
    Ran Canetti, Oded Goldreich, Shafi Goldwasser, and Silvio Micali. Resettable Zero-Knowledge. STOC 2000, pages 235–244, 2000. Available from http://www.wisdom.weizmann.ac.il/~oded/.
  4. 4.
    Ran Canetti, Joe Kilian, Erez Petrank, and Alon Rosen. Black-box Concurrent Zeroknowledge Requires Ω (log n) Rounds. In ACM Symposium on Theory of Computing (33rd STOC 2001), pages 570–579, 2001.Google Scholar
  5. 5.
    O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology, 7(1):1–32, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions. Journal of the Association for Computing Machinery, 33(4):792–807, 1986.MathSciNetGoogle Scholar
  7. 7.
    Silvio Micali and Leonid Reyzin. Min-Round Resettable Zero-Knowledge in the Public-Key Model. In B. Pfitzmann (Ed.): EUROCRYPT 2001, LNCS 2045, pages 373–393. Springer-Verlag, 2001. Available from http://www.cs.bu.edu/~reyzin/.CrossRefGoogle Scholar
  8. 8.
    Silvio Micali and Leonid Reyzin. Soundness in the Public-Key Model. In J. Kilian (Ed.): CRYPTO 2001, LNCS 2139, pages 542–565. Springer-Verlag, 2001. Available from http://www.cs.bu.edu/~reyzin/.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Shirley H. C. Cheung
    • 1
  • Xiaotie Deng
    • 1
  • C. H. Lee
    • 1
  • Yunlei Zhao
    • 1
  1. 1.Department of Computer ScienceCity University of Hong KongHong Kong

Personalised recommendations