大多数无证书签名方案需要多个双线性对运算,导致效率较低.为此,基于强Diffie-Hellman问题,提出一种新的无证书短签名方案,在签名的生成和验证过程中只需要1次双线性对运算和1次哈希函数操作,且签名长度与Boneh-Boyen的短签名长度相同.在标准模型下证明该方案对于2类敌手的攻击均具有不可伪造性.%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.
展开▼
