Sciweavers

Share
CISC
2007
Springer

An Efficient ID-Based Proxy Signature Scheme from Pairings

10 years 3 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
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.
Chunxiang Gu, Yuefei Zhu
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2007
Where CISC
Authors Chunxiang Gu, Yuefei Zhu
Comments (0)
books