## CryptoDB

### Paper: Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem

Authors: Zhen-Feng ZHANG Jing XU Deng-Guo FENG URL: http://eprint.iacr.org/2003/153 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2003-11867,
title={Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / identification scheme, Gap Diffie-Hellman, weil-pairing},
url={http://eprint.iacr.org/2003/153},
note={ zfzhang@is.iscas.ac.cn 12265 received 31 Jul 2003},
author={Zhen-Feng ZHANG and Jing XU and Deng-Guo FENG},
year=2003
}