无证书的聚合签名方案  

A Certificateless Aggregate Signature Scheme

作　　者：刘纯璐 游林[2] LIU Chunlu;YOU Lin(School of Communication Engineering,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China;School of Cyberspace Security,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China)

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018 [2]杭州电子科技大学网络空间安全学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2019年第6期12-17,共6页Journal of Hangzhou Dianzi University：Natural Sciences

基　　金：浙江省自然科学基金资助项目(LZ17F020002);国家自然科学基金资助项目(61772166)

摘　　要：结合无证书公钥密码签名算法的可靠性和聚合签名算法的高效性,在优化签名算法与验证算法的基础上,提出一个在随机预言机模型下具有高安全性和低运算量的无证书的聚合签名方案。在计算Diffie-Hellman假设前提下,针对两种典型敌手,证明了方案的不可伪造性。相较于同类型签名方案,该方案降低约50%的运算量,在带宽、存储和计算资源受限的网络环境中有较好的实际应用效果。Combining the reliability of the certificateless public key cryptography algorithm and the efficiency of the aggregation signature algorithm,based on the optimization of the signature algorithm and the verification algorithm,a certificateless aggregate signature scheme with high security and low computational complexity is proposed under the random oracle model.Based on the assumption of Diffie-Hellman problem,the unforgeability of the scheme is proved for two typical adversaries.Compared with prevailing signature schemes of the same type,our scheme can reduce the computational complexity by about 50%and has better practical application effects in a network environment with limited bandwidth,storage and computing resources.

关 键 词：聚合签名 无证书 双线性对 DIFFIE-HELLMAN问题 

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