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

高效的短签密方案
引用本文:杜红珍,温巧燕.高效的短签密方案[J].北京邮电大学学报,2008,31(1):84-87.
作者姓名:杜红珍  温巧燕
作者单位:北京邮电大学,网络与交换技术国家重点实验室,北京,100876;宝鸡文理学院,数学系,宝鸡,721007;北京邮电大学,网络与交换技术国家重点实验室,北京,100876
基金项目:国家高技术研究发展计划(863计划),国家自然科学基金,北京市自然科学基金,宝鸡文理学院项目
摘    要:基于BLS短签名和Gap Diffie-Hellman群,提出了1个新型短签密方案.在Random Oracle模型下证明了该方案对适应性选择密文攻击是安全的,其安全性可规约为计算Diffie-Hellman问题.该方案具备不可伪造性、公开验证性和前向安全性,且计算量小,签密与解签密仅需2次对运算,通信成本低,签密数据率可达28%,适于传输带宽受限的环境

关 键 词:短签名  公开验证性  前向安全性
文章编号:1007-5321(2008)01-0084-04
收稿时间:2007-01-23
修稿时间:2007年1月23日

Efficient Short Signcryption Scheme
DU Hong-zhen,WEN Qiao-yan.Efficient Short Signcryption Scheme[J].Journal of Beijing University of Posts and Telecommunications,2008,31(1):84-87.
Authors:DU Hong-zhen  WEN Qiao-yan
Affiliation:1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. Department of Mathematics, Baoji University of Arts and Sciences, Baoji 721007, China
Abstract:A new signcryption scheme based on the BLS short signature and Gap Diffie-Hellman groups is proposed. It is proved that the new scheme is secure against adaptively chosen ciphertext attack in the random oracle model, and its security is reduced to computational Diffie-Hellman problem. The new scheme enjoys desirable properties as follows: signature unforgeability, public verifiability and forward secrecy. The computational costs and communication overheads of the new scheme are lower than those of signcryption schemes available, and the whole operation only requires two pairing evaluations, and the data rate of signcryption can amount to 28 percents. So the new scheme can be used in environments with stringent bandwidth constraints.
Keywords:short signature  public verifiability  forward secrecy
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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