Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information and Communications Security

ICICS 2001: Information and Communications Security pp 271–279Cite as

An Identification Scheme Provably Secure against Reset Attack

  • Conference paper
  • First Online:

  • 582 Accesses

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

Abstract

We develop an efficient identification scheme based on Cramer-Shoup test function. The scheme is provably secure against reset attack under post-processing model provided the hardness assumption of the decisional Diffie-Hellman problem as well as the existence of collision free hash functions.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bellare, S. Goldwasser, M. Micali. Identification protocols secure against reset attacks. http://wwww-cse.ucsd.edu/users/mihir, 2000.

  2. M. Bellare, D. Pointcheval, P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Advances in Cryptology-Eurocrypt 2000 Proceedings, In Advances in Cryptology-Proceedings of EUROCRYPT’ 2000, Brugge, Belgium, Pages 139–155, 2000.

    Google Scholar 

  3. M. Bellare, P. Rogaway. Entity authentication and key distribution. Extended abstract in Advances in Cryptology-Crypto’93 Proceedings, pages 232–233, Santa Barbara, California, August 1993.

    Google Scholar 

  4. R. Canetti, S. Goldwasser, O. Goldreich, S. Micali. Resettable zero-knowledge. Proceedings of 32nd Annual Symposium on the theory of Computing, ACM 2000. http://www.research.ibm.com/security/publ.html.

  5. R. Cramer, V. Shoup.A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Advances in Cryptology-Crypto’93 Crypto’ 98, pages 13–25, Santa Barbara, California, August 1998.

    Google Scholar 

  6. W. Diffie, M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–654, November 1976.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Fiat, A. Shamir. How to prove yourself: practical solutions to identification and signature problems. Advances in Cryptology: Proceedings of Cryptology-Crypto’86, 1986.

    Google Scholar 

  8. M. Naor, M. Yung. Public key cryptosystem secure against chosen cipher-text attacks. 22nd Annual ACM Symposium on the theory of computing, pages 427–437, 1990.

    Google Scholar 

  9. C. Racko., D. Simon. Non-interactive zero-knowledge proofofknow ledge and chosen cipher-text attacks. Advances in Cryptology: Proceedings of Cryptology-Crypto’91. Pages 433–444, Santa Barbara, California, August 1992.

    Google Scholar 

  10. C.P. Schnorr. Efficient identification and signature for smart card. Advances in Cryptology: Proceedings of Crypto’89, pages 235–251, Santa Barbara, California, August 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of computer science, City university of Hong Kong, Hong Kong

    C.-H. Lee & X. Deng

  2. Department of information and electronics engineering, Zhejiang university, 310027, Hangzhou, PR. China

    H. Zhu

Authors
  1. C.-H. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. X. Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Research Center for Information Security Technology (ERCIST), Chinese Academy of Sciences, P.O. Box 8718, 100080, Beijing, China

    Sihan Qing

  2. NTT Labs, 1-1 Hikarinooka, 239-0847, Yokosuka-shi, Japan

    Tatsuaki Okamoto

  3. Oracle Corporation, 500 Oracle Parkway, 94065, Redwood Shores, CA, USA

    Jianying Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, CH., Deng, X., Zhu, H. (2001). An Identification Scheme Provably Secure against Reset Attack. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45600-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42880-0

  • Online ISBN: 978-3-540-45600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation