一种可证明安全的代理聚合签名方案  

A Security-Provable Proxy Aggregate Signature Scheme

作　　者：张青[1] 何为 戴阔斌 胡志华[1,3] ZHANG Qing;HE Wei;DAI Kuobin;HU Zhihua(Computer School,Huanggang Normal University,Huanggang 438000,Hubei,China;College of Computer Science,China University of Geosciences,Wuhan 430074,Hubei,Chin;School of Computer,Wuhan University,Wuhan 430072,Hubei,China)

机构地区：[1]黄冈师范学院计算机学院,湖北黄冈438000 [2]中国地质大学计算机学院,湖北武汉430074 [3]武汉大学计算机学院,湖北武汉430072

出　　处：《武汉大学学报（理学版）》2018年第5期415-422,共8页Journal of Wuhan University:Natural Science Edition

基　　金：湖北省自然科学基金资助项目(2014CFC1100,2013CFB473,2012FFC034)

摘　　要：通过对现有的代理聚合签名方案的分析,发现KGC（key generation conter）分发密钥均基于一个假设的安全信道,在实际应用中会有安全漏洞：假设KGC在分发密钥的过程中泄漏了私钥,则敌手可成功伪造任何消息的合法签名.本文提出了一种基于双线性对的可证明安全的代理聚合签名方案,在该方案中,签名方案的公钥由KGC和用户共同产生,这样即使敌手在通信中获取KGC分发的私钥也不可伪造签名.在随机预言机模型下,证明了即使在对手最大限度获得相关权限的情况下,也可归约为解决CDH（Compute Diffie-Hellman）难题,并对签名方案进行了效率分析.从分析结果可以看出我们设计的方案更加安全和高效.By the analysis of existing proxy aggregate signature schemes,we find that the KGC-distributed key is based on a hypothetic secure channel,which is likely to have security holes in practical applications.If the private key is divulged during KGC key distribution,a valid signature for any information can be successfully forged.Based on bilinear pairings,this paper presents a security-provable proxy aggregate signature scheme,in which the public key is generated by KGC and the user so that the signature will not be forged even if the private key is given away during KGC key distribution.Under random oracle model,agame between the opponent and the challenger proves that the security of the presented scheme can be reduced to CDH（Compute Diffie-Hellman）problem even if the opponent obtains the maximum relevant permissions.At the same time,it＇s verified that the computational efficiency of the scheme is much higher than that of other schemes.

关 键 词：聚合签名 随机预言机 可证明安全 CDH(Compute Diffie-Hellman)问题 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]