计算机工程

• 安全技术 • 上一篇    下一篇

可证明安全的高效有序聚合签名方案

王大星1,滕济凯2   

  1. (1.滁州学院数学与金融学院,安徽 滁州 239000; 2.中国科学院信息工程研究所,北京 100190)
  • 收稿日期:2014-08-14 出版日期:2015-08-15 发布日期:2015-08-15
  • 作者简介:王大星(1980-),男,副教授、硕士,主研方向:密码学;滕济凯,讲师、博士。
  • 基金项目:
    国家自然科学基金资助项目(61303256);安徽高校自然科学基金资助项目(KJ2013B185);滁州学院自然科学基金资助项目(2012kj001Z)。

Provably Secure Efficient Sequential Aggregate Signature Scheme

WANG Daxing  1,TENG Jikai  2   

  1. (1.School of Mathematics and Finance,Chuzhou University,Chuzhou 239000,China; 2.Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100190,China)
  • Received:2014-08-14 Online:2015-08-15 Published:2015-08-15

摘要: 聚合签名技术将多个用户的签名压缩成一个签名,适用于需要将不同用户对不同消息的签名聚合成单一签名的情况,可提高签名的验证和传输效率,但现有聚合签名方案在计算效率、通信成本和安全性等方面还存在不足。为此,基于CL-签名的思想,提出一种有序聚合签名方 案,并在LRSW假设下证明方案的安全性。分析结果表明,该方案可提高签名验证算法的计算效率,而且具有较短的公钥和签名长度。

关键词: 聚合签名, 有序聚合签名, CL-签名, 安全模型, 可证明安全, 双线性对

Abstract: Aggregate signature technology compresses multiple users signature into one signature,which is useful in special areas where the signatures on many different messages generated by many different users need to be aggregated,and which improves the efficiency of the signature’s verification and transmission.However,in the current aggregate signature schemes,there are problems in computational efficiency,communication cost and security aspects.An sequential aggregate signature scheme based Camenisch Lysyanskaya(CL)-signature is proposed,which is provably secure under LRSW assumptions without random oracle model.Further,the new scheme has the excellent features with short length of the public key and the signature compared with existing solutions,and it improves the computational efficiency of the signature verification algorithm.

Key words: aggregate signature, sequential aggregate signature, Camenisch Lysyanskaya(CL)-signature, security model, provably secure, bilinear pairings

中图分类号: