一个无证书聚合签名方案的分析与改进  

Analysis and improvement of certificateless aggregate signature scheme

作　　者：胡江红[1] 杜红珍[1] 张建中[2] 

机构地区：[1]宝鸡文理学院数学与信息科学学院,陕西宝鸡721013 [2]陕西师范大学数学与信息科学学院,西安710062

出　　处：《计算机工程与应用》2016年第10期80-84,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61402015);陕西省自然科学基础研究计划(No.2015JM6263);陕西省教育厅专项科研计划项目(No.15JK1022);宝鸡市科技计划项目(No.14GYGG-4-2);宝鸡文理学院科研计划重点项目(No.ZK14058)

摘　　要：对侯红霞等人提出的无证书聚合签名方案进行分析,指出该方案是不安全的,无法抵抗第二种类型敌手的攻击,并对该方案进行改进,提出了一个新的无证书聚合签名方案,利用Diffie-Hellman困难问题,在随机预言模型下证明了新方案是存在性不可伪造的。效率分析表明,新方案在签名验证中只需要3个对运算和n个标量乘运算,比已有方案效率更高更安全。Through analysis of a certificateless aggregate signature scheme proposed by Hou et al, it is revealed that the scheme is not secure and it cannot resist the type two adversary attack. Based on this scheme, an improved certificateless aggregate signature scheme is proposed in this paper. Under the computational Diffie-Hellman problem, it is proved that the new scheme is secure against existential forgery attack in the random oracle model. The result indicates that the new scheme only needs three pairing computations and n scalar multiplication computations in verification phase. The new scheme is more efficient and secure than existed schemes.

关 键 词：聚合签名 无证书密码体制 双线性对 Diffie-Hellman困难问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]