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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.