An Identification Scheme Provably Secure against Reset Attack
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.
Unable to display preview. Download preview PDF.
- 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
- 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