Cryptology ePrint Archive: Report 2003/153

Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem

Zhen-Feng ZHANG and Jing XU and Deng-Guo FENG

Abstract: In [KK], a new identification scheme based on the Gap Diffie-Hellman problem was proposed at SCIS 2002, and it is shown that the scheme is secure against active attacks under the Gap Diffie-Hellman Intractability Assumption. Paradoxically,this identification scheme is totally breakable under passive attacks. In this paper, we show that any adversary holding only public parameters of the scheme can convince a verifier with probability 1.

Category / Keywords: cryptographic protocols / identification scheme, Gap Diffie-Hellman, weil-pairing

Date: received 31 Jul 2003

Contact author: zfzhang at is iscas ac cn

Available format(s): PDF | BibTeX Citation

Version: 20030802:213229 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]