Efficient Certificateless Short Signature Scheme Under Standard Model
Chun‐Yan Wei, Xiao‐Qiu Cai · Jisuanji gongcheng · 2012
Most certificateless signature schemes are inefficient because they need several bilinear parings operations.Aiming at the problem,this paper proposes a new certificateless short signature scheme based on Strong Diffie-Hellman(SDH) problem.It is more efficient because it needs only one bilinear parings operation and one hash operation in signing and verifying processes,and it has the same length as Boneh-Boyen's short signature.It is proved satisfying non-forgeability under two types of adversaries' attacks under standard model.