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

Provably Secure Efficient Sequential Aggregate Signature Scheme

作　　者：王大星[1] 滕济凯[2] 

机构地区：[1]滁州学院数学与金融学院,安徽滁州239000 [2]中国科学院信息工程研究所,北京100190

出　　处：《计算机工程》2015年第8期140-143,155,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(61303256);安徽高校自然科学基金资助项目(KJ2013B185);滁州学院自然科学基金资助项目(2012kj001Z)

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

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

分 类 号：TP309[自动化与计算机技术—计算机系统结构]