International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: An Efficient ID-based Signature Scheme from Pairings

Authors:
Chunxiang Gu
Yuefei Zhu
Xiaoyu Pan
Download:
URL: http://eprint.iacr.org/2006/060
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2006-21553,
  title={An Efficient ID-based Signature Scheme from Pairings},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / ID-based signatures, pairings, provable security, Forking Lemma.},
  url={http://eprint.iacr.org/2006/060},
  note={ gcxiang5209@yahoo.com.cn 13221 received 22 Feb 2006, withdrawn 13 Mar 2006},
  author={Chunxiang Gu and Yuefei Zhu and Xiaoyu Pan},
  year=2006
}