A new identification scheme based on Gap Diffie-Hellman problem (2002)

by M Kim, K Kim
Venue:The 2002 Symposium on Cryptography and Information Security
Add To MetaCart
Results 1 - 1 of 1

An Improved Identification Scheme

by Gang Yao, Gang Yao Guilin, Yong Wang - in Coding, Cryptography, and Combinatorics, Berkhäuser-Verlag Progress in Computer Science and Applied Logic 23 (2004), 397-405. IDENTIFICATION SCHEMES 13 , 2004
"... M. Kim and K. Kim [1] introduce a new identification scheme based on the Gap Di#e-Hellman problem, and prove that the scheme is secure against active attacks if the Gap Di#e-Hellman problem is intractable. But, their identification scheme is NOT secure. In this paper, we give the reason that why the ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
M. Kim and K. Kim [1] introduce a new identification scheme based on the Gap Di#e-Hellman problem, and prove that the scheme is secure against active attacks if the Gap Di#e-Hellman problem is intractable. But, their identification scheme is NOT secure. In this paper, we give the reason that why the scheme is not secure, and we also modify the scheme such that the modified scheme is secure against active attacks if the Gap Di#e-Hellman problem is intractable.