Paper 2003/153

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

Zhen-Feng ZHANG, 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
identification schemeGap Diffie-Hellmanweil-pairing
Contact author(s)
zfzhang @ is iscas ac cn
History
2003-08-02: received
Short URL
https://ia.cr/2003/153
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2003/153,
      author = {Zhen-Feng ZHANG and Jing XU and Deng-Guo FENG},
      title = {Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem},
      howpublished = {Cryptology ePrint Archive, Paper 2003/153},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/153}},
      url = {https://eprint.iacr.org/2003/153}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.