作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (8): 108-111. doi: 10.3969/j.issn.1000-3428.2011.08.037

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

高效的无证书紧致有序多重签名方案

张玉磊   

  1. (西北师范大学数学与信息科学学院,兰州 730070)
  • 出版日期:2011-04-20 发布日期:2012-10-31
  • 作者简介:张玉磊(1979-),男,讲师、硕士,主研方向:信息安全
  • 基金资助:
    国家自然科学基金资助项目(61063041);西北师范大学青年教师科研基金资助项目(NWNU-LKQN-09-5)

Efficient Certificateless Compact Sequential Multi-signature Scheme

ZHANG Yu-lei   

  1. (College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China)
  • Online:2011-04-20 Published:2012-10-31

摘要: 基于无证书公钥密码体制和双线性对技术,提出一种高效、紧致的无证书有序多重签名方案。该方案得到的签名长度固定,不随签名人数的改变而变化,需要的双线性对运算数固定,且签名算法和验证算法的复杂度与签名人数无关。方案的安全性依赖于计算Diffie-Hellman困难问题,在随机预言模型下的分析结果验证了该方案的安全性。

关键词: 无证书签名, 有序多重签名, 紧致签名, 双线性对

Abstract: A new efficient certificateless compact sequential multi-signature scheme is proposed based on the certificateless public key cryptosystem and bilinear pairing technology. The scheme is compact, the length of signature is fixed, and does not grow with the number of the singer. Meanwhile, the scheme is efficient. In the scheme, the numbers of bilinear pairing is also fixed, and the computation complicacy of signature algorithm or verify algorithm is independent with the singer’s number. Furthermore, basing the random oracle, the scheme proves secure against existential forgery under the adaptive chosen message attacks, assuming that the computation Diffie-Hellman problem assumption holds.

Key words: certificateless signature, sequential multi-signature, compact signature, bilinear pairing

中图分类号: