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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Bellare, S. Goldwasser, M. Micali. Identification protocols secure against reset attacks. http://wwww-cse.ucsd.edu/users/mihir, 2000.
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.
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.
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.
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.
W. Diffie, M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–654, November 1976.
A. Fiat, A. Shamir. How to prove yourself: practical solutions to identification and signature problems. Advances in Cryptology: Proceedings of Cryptology-Crypto’86, 1986.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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