An Improved Identification Scheme
Gang Yao, Guilin Wang, Yong Wang
Abstract
Gang Yao, Guilin Wang, Yong Wang
Abstract
Kim and Kim recently proposed a new identification scheme based on the Gap Diffie-Hellman problem, and proved that their scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. However, their identification scheme is NOT secure in fact. In this paper, we first point out the reason why their scheme is not secure, and then improve their scheme such that the modified scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Kim and Kim recently proposed a new identification scheme based on the Gap Diffie-Hellman problem, and proved that their scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. However, their identification scheme is NOT secure in fact. In this paper, we first point out the reason why their scheme is not secure, and then improve their scheme such that the modified scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable.
Key concepts: Identification scheme, Scheme (mathematics), Identification (biology), Computer science, Mathematics, Data mining, Biology, Mathematical analysis