Cryptology ePrint Archive: Report 2006/158
An Efficient ID-based Proxy Signature Scheme from Pairings
Chunxiang Gu and 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.
Category / Keywords: public-key cryptography / ID-based cryptography, proxy signatures, bilinear pairings.
Date: received 25 Apr 2006
Contact author: gcxiang5209 at yahoo com cn
Available formats: PDF | BibTeX Citation
Version: 20060503:060743 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]