论文信息 - Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem

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

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.

[1] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[2] Amos Fiat,et al. Zero-knowledge proofs of identity , 1987, Journal of Cryptology.

[3] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[4] Myungsun Kim. A New Identification Scheme based on the Gap Die-Hellman Problem , 2002 .

[5] Victor Shoup. On the Security of a Practical Identification Scheme , 1996, EUROCRYPT.