SUMMARY
Proxy signature is an active research area in cryptography. A proxy signature scheme allows an entity to delegate his or her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Many proxy signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is more than 10 times of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose a proxy signature scheme without bilinear pairings and prove its security against adaptive chosen-message attack in random oracle model. The security of our scheme is based on the hardness of the elliptic curve discrete logarithm problem. With the running time being saved greatly, our scheme is more practical than the previous related scheme for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.
[1]
Zhijian Wang,et al.
A provably secure proxy signature scheme from bilinear pairings
,
2010
.
[2]
Silvio Micali,et al.
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
,
1988,
SIAM J. Comput..
[3]
Yuefei Zhu,et al.
An Efficient ID-Based Proxy Signature Scheme from Pairings
,
2007,
Inscrypt.
[4]
Yongjuan Wang,et al.
An Identity-Based Proxy Signature from Bilinear Pairings
,
2009,
2009 WASE International Conference on Information Engineering.
[5]
Jacques Stern,et al.
Security Arguments for Digital Signatures and Blind Signatures
,
2015,
Journal of Cryptology.
[6]
Yi Mu,et al.
Identity-Based Proxy Signature from Pairings
,
2007,
ATC.
[7]
Nigel P. Smart,et al.
High Security Pairing-Based Cryptography Revisited
,
2006,
ANTS.