首页 | 本学科首页   官方微博 | 高级检索  
     

高效的可证明安全的无证书聚合签名方案
引用本文:杜红珍,黄梅娟,温巧燕. 高效的可证明安全的无证书聚合签名方案[J]. 电子学报, 2013, 41(1): 72-76. DOI: 10.3969/j.issn.0372-2112.2013.01.014
作者姓名:杜红珍  黄梅娟  温巧燕
作者单位:1. 宝鸡文理学院数学系,陕西宝鸡,721013
2. 北京邮电大学网络与交换技术国家重点实验室,北京,100876
基金项目:国家自然科学基金(No.61170270);陕西省自然科学基础基金(No.2010JQ8027);陕西省教育厅科学研究基金(No.12JK1003)
摘    要:利用双线性对构造了一个高效的无证书聚合签名方案,在随机预言机模型下给出了方案的安全性证明,其安全性基于计算Diffie-Hellman难题.与已有的无证书聚合签名方案相比,本文方案更能提高签名验证与传输效率,因聚合签名的验证只需要计算4个双线性对,签名的长度是固定的,仅有320bits,是目前最短的无证书聚合签名.

关 键 词:无证书公钥密码体制  聚合签名  计算Diffie-Hellman难题  双线性对
收稿时间:2011-12-28

Efficient and Provably-Secure Certificateless Aggregate Signature Scheme
DU Hong-zhen , HUANG Mei-juan , WEN Qiao-yan. Efficient and Provably-Secure Certificateless Aggregate Signature Scheme[J]. Acta Electronica Sinica, 2013, 41(1): 72-76. DOI: 10.3969/j.issn.0372-2112.2013.01.014
Authors:DU Hong-zhen    HUANG Mei-juan    WEN Qiao-yan
Affiliation:1.Department of Mathematics,Baoji University of Arts and Sciences,Baoji,Shaanxi 721013,China;2.State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China)
Abstract:This paper proposes an efficient certificateless aggregate signature scheme from bilinear pairings.Its security proof is given in the random oracle model and it can be reduced to computational Diffie-Hellman problem.Compared with the existing certificateless aggregate signature schemes,our scheme drastically improves the efficiency of signature communication and verification since the verification algorithm only requires 4 pairings,and the length of the signature generated by our scheme is only about 320 bits,which is the shortest certificateless aggregate signature.
Keywords:certificateless public key cryptography  aggregate signature  computational Diffie-Hellman problem  bilinear pairings
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号