摘要: 大多数无证书签名方案需要多个双线性对运算,导致效率较低。为此,基于强Diffie-Hellman问题,提出一种新的无证书短签名方案,在签名的生成和验证过程中只需要1次双线性对运算和1次哈希函数操作,且签名长度与Boneh-Boyen的短签名长度相同。在标准模型下证明该方案对于2类敌手的攻击均具有不可伪造性。
关键词:
无证书密码学,
标准模型,
随机预言,
强Diffie-Hellman问题,
双线性对,
不可伪造性
Abstract: 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.
Key words:
certificateless cryptography,
standard model,
random oracle,
Strong Diffie-Hellman(SDH) problem,
bilinear parings,
non-forgeability
中图分类号:
魏春艳, 蔡晓秋. 标准模型下的高效无证书短签名方案[J]. 计算机工程, 2012, 38(13): 119-121.
WEI Chun-Yan, CA Xiao-Qiu. Efficient Certificateless Short Signature Scheme Under Standard Model[J]. Computer Engineering, 2012, 38(13): 119-121.