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

计算机工程 ›› 2011, Vol. 37 ›› Issue (24): 18-21. doi: 10.3969/j.issn.1000-3428.2011.24.007

• 博士论文 • 上一篇    下一篇

基于双线性对的无证书签名与群签名方案

李凤银 1,2,刘培玉 1,朱振方 1   

  1. (1. 山东师范大学信息科学与工程学院,济南 250014;2. 曲阜师范大学计算机科学学院,山东 日照 276826)
  • 收稿日期:2011-03-18 出版日期:2011-12-20 发布日期:2011-12-20
  • 作者简介:李凤银(1974-),女,副教授、博士研究生,主研方向:信息安全,数字签名;刘培玉,教授、博士生导师;朱振方,博士研究生
  • 基金资助:
    国家自然科学基金资助项目(60873247);山东省自然科学基金资助重点项目(ZR2009GZ007);山东省高新技术自主创新工程基金资助项目(2008ZZ28)

Certificateless Signature and Group Signature Schemes Based on Bilinear Pairings

LI Feng-yin 1,2, LIU Pei-yu 1, ZHU Zhen-fang 1   

  1. (1. School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China; 2. College of Computer Science, Qufu Normal University, Rizhao 276826, China)
  • Received:2011-03-18 Online:2011-12-20 Published:2011-12-20

摘要: 传统数字签名方案的证书存储和管理开销较大,基于身份的数字签名方案无法解决其固有的密钥托管问题,而无证书签名方案无需使用公钥证书,且没有密钥托管问题。为此,提出一个基于双线性映射的无证书签名方案,并在随机预言机模型下证明其安全性。在此基础上设计一个无证书群签名方案,其安全性建立在计算Diffie-Hellman问题的困难性假设上。性能分析表明,2种签名方案在保证安全性的前提下,具有较高的执行效率。

关键词: 无证书密码体制, 群签名, 双线性映射, Diffie-Hellman问题, 随机预言机

Abstract: Traditional digital signature schemes need much more storage and management overhead for the use of certificates, while the identity-based digital signature schemes fail to solve the inherent key-escrow problem. Certificateless signature schemes need no certificates and can solve the key-escrow problem. This paper presents a certificateless signature scheme from bilinear pairings, and verifies its security under the random oracle machine. It designs a certificateless group signature scheme from the certificateless signature scheme, and its security is founded under the assumption of the computational Diffie-Hellman problem. Performance analysis shows that both signature schemes are secure and have high performing efficiency.

Key words: certificateless cryptography, group signature, bilinear mapping, Diffie-Hellman problem, random oracle machine

中图分类号: