An Efficient ID-based Proxy Signature Scheme from Pairings

Chunxiang Gu; Yuefei Zhu

Paper 2006/158 Original: eprint.iacr.org/2006/158 ↗

An Efficient ID-based Proxy Signature Scheme from Pairings

Chunxiang Gu

Yuefei Zhu

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2006-05-03: last updated; 2006-05-03: published
Short URL: https://ia.cr/2006/158
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2006/158,
      author = {Chunxiang Gu and Yuefei Zhu},
      title = {An Efficient ID-based Proxy Signature Scheme from Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/158},
      year = {2006},
      url = {https://eprint.iacr.org/2006/158}
}