Cryptology ePrint Archive: Report 2006/060
An Efficient ID-based Signature Scheme from Pairings
Chunxiang Gu and 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.
Category / Keywords: public-key cryptography / ID-based signatures, pairings, provable security, Forking Lemma.
Date: received 22 Feb 2006, withdrawn 13 Mar 2006
Contact author: gcxiang5209 at yahoo com cn
Available format(s): (-- withdrawn --)
Version: 20060314:013832 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]