吉林大学学报(理学版)

• 计算机科学 • 上一篇    下一篇

可证明安全的时钟同步聚合签名方案

王大星1, 滕济凯2   

  1. 1. 滁州学院 数学与金融学院, 安徽 滁州 239000; 2. 中国科学院 信息工程研究所, 北京 100190
  • 收稿日期:2014-08-25 出版日期:2015-09-26 发布日期:2015-09-29
  • 通讯作者: 滕济凯 E-mail:jikai@is.iscas.ac.cn

Provably Secure Clock Synchronized Aggregate Signature Scheme

WANG Daxing1, TENG Jikai2   

  1. 1. School of Mathematics and Finance, Chuzhou University, Chuzhou 239000, Anhui Province, China;2. Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100190, China
  • Received:2014-08-25 Online:2015-09-26 Published:2015-09-29
  • Contact: TENG Jikai E-mail:jikai@is.iscas.ac.cn

摘要:

针对目前同步聚合签名方案在计算效率、 通信成本和安全性等方面存在的问题, 提出一种基于Camenisch Lysyanskaya签名的时钟同步聚合签名方案, 并在LRSW假设下, 证明了该方案的安全性. 结果表明, 与已有方案相比, 新方案减小了签名的通信成本和计算量, 并具有较短的公钥长度和聚合签名长度.

关键词: 聚合签名, 时钟同步, 可证明安全, 双线性对

Abstract:

For the problems existed in computational efficiency, communication cost and security in the current synchronized aggregate signature schemes, a clock synchronized aggregate signature scheme based on Camenisch Lysyanskayasignature was proposed, which proved to be secure under LRSW as sumptions. Further, compared with existed schemes, the new scheme has the excellent features with a short length of the public key and that of the signature, and it improves the computational efficiency of the signature algorithm.

Key words: aggregate signature, clock synchronization, provably secure, bilinear pairing

中图分类号: 

  • TP309