An Efficient ID-based Signature Scheme from Pairings
Chunxiang Gu, Yuefei Zhu, and Xiaoyu Pan
In this paper, we propose an efficient ID-based signature scheme based on pairing. The number of paring operation involved in the verification procedure is one. Our scheme is proved secure against existential forgery on adaptively chosen message and ID attack under the hardness assumption of computational Diffie-Hellman problem, in the random oracle model.
- Available format(s)
- -- withdrawn --
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- ID-based signaturespairingsprovable securityForking Lemma.
- Contact author(s)
- gcxiang5209 @ yahoo com cn
- 2006-03-14: withdrawn
- 2006-02-23: received
- See all versions
- Short URL