A New Identification Scheme based on the Gap Diffie-Hellman Problem

Abstract

We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. We prove that this scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. Finally, we analyze efficiency of the scheme comparing with other identification schemes

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://caislab.icu.ac.kr/pub/p... (external link)