Paper 2006/060

An Efficient ID-based Signature Scheme from Pairings

Chunxiang Gu, Yuefei Zhu, and Xiaoyu Pan

Abstract

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.

Metadata
Available format(s)
-- withdrawn --
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
ID-based signaturespairingsprovable securityForking Lemma.
Contact author(s)
gcxiang5209 @ yahoo com cn
History
2006-03-14: withdrawn
2006-02-23: received
See all versions
Short URL
https://ia.cr/2006/060
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.