International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

An Efficient ID-based Proxy Signature Scheme from Pairings

Authors:
Chunxiang Gu
Yuefei Zhu
Download:
URL: http://eprint.iacr.org/2006/158
Search ePrint
Search Google
Abstract: This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is only one, so our scheme is more efficient comparatively. The new scheme can be proved secure with the hardness assumption of the k-Bilinear Diffie-Hellman Inverse problem, in the random oracle model.
BibTeX
@misc{eprint-2006-21651,
  title={An Efficient ID-based Proxy Signature Scheme from Pairings},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / ID-based cryptography, proxy signatures, bilinear pairings.},
  url={http://eprint.iacr.org/2006/158},
  note={ gcxiang5209@yahoo.com.cn 13264 received 25 Apr 2006},
  author={Chunxiang Gu and Yuefei Zhu},
  year=2006
}