高效的短签密方案.pdfVIP

2008年2月 北 京 邮 电 大 学 学 报 Feb．2008 第31卷 第1期 Journal of Beijing University of Posts and Telecommunications Vo1．31 NO．1 文章编号：1007—5321(2008)01．0084—04 高效的短签密方案 杜红珍 2， 温巧燕 (1．北京邮电大学网络与交换技术国家重点实验室，北京100876；2．宝鸡文理学院数学系，宝鸡721007) 摘要：基于BLS短签名和Gap Diffie—Hellman群，提出了1个新型短签密方案．在Random Oracle模型下证明了该 方案对适应性选择密文攻击是安全的，其安全性可规约为计算Diffie-Hellman问题．该方案具备不可伪造性、公开 验证性和前向安全性，且计算量小，签密与解签密仅需2次对运算，通信成本低，签密数据率可达28％，适于传输带 宽受限的环境． 关 键 词：短签名；公开验证性；前向安全性 中图分类号：TN918 文献标识码：A Efficient Short Signcryption Scheme DU Hong—zhen 一， WEN Qiao—yan (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 for— ward 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 envi— ronments with stringent bandwidth constraints． Key words：short signature；public verifiability；forward secrecy 签密的概念是Zheng[1．在 1997年提出的，这是 好．1998年，Bao和 Deng提出了第 1个可公开验 一 种用很有效的方式获得签名和加密组合功能的公 证的签密