计算机工程2011，Vol.37Issue(24)：18-21,4.DOI:10.3969/j.issn.1000-3428.2011.24.007
基于双线性对的无证书签名与群签名方案
Certificateless Signature and Group Signature Schemes Based on Bilinear Pairings
摘要
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.关键词
无证书密码体制/群签名/双线性映射/Diffie-Hellman问题/随机预言机Key words
certificateless cryptography/ group signature/ bilinear mapping/ Diffie-Hellman problem/ random oracle machine分类
信息技术与安全科学引用本文复制引用
李凤银,刘培玉,朱振方..基于双线性对的无证书签名与群签名方案[J].计算机工程,2011,37(24):18-21,4.基金项目
国家自然科学基金资助项目(60873247) （60873247）
山东省自然科学基金资助重点项目(ZR2009GZ007) （ZR2009GZ007）
山东省高新技术自主创新工程基金资助项目(2008ZZ28) （2008ZZ28）
