北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (6): 18-21.doi: 10.13190/jbupt.200806.18.201

• 论文 • 上一篇    下一篇

高效的无证书强代理签名方案

杜红珍1, 2, 温巧燕1, 李文敏1, 金正平1   

  1. (1. 北京邮电大学 网络与交换技术国家重点实验室, 北京 100876; 2. 宝鸡文理学院 数学系, 宝鸡 721007)
  • 收稿日期:2007-11-09 修回日期:2008-09-09 出版日期:2008-12-31 发布日期:2008-12-31
  • 通讯作者: 杜红珍

Efficient Certificateless Strong Proxy Signature Scheme

DU Hong-zhen1.2, WEN Qiao-yan1, LI Wen-min1, JIN Zheng-ping1   

  1. (1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. Department of Mathematics, Baoji University of Arts and Sciences, Baoji 721007, China)
  • Received:2007-11-09 Revised:2008-09-09 Online:2008-12-31 Published:2008-12-31
  • Contact: DU Hong-zhen

摘要:

提出无证书强代理签名的定义及安全模型,利用双线性对构造了一个无证书强代理签名方案. 该方案能满足无证书公钥体制下强代理签名应具备的所有性质,且在构造过程中只用到普通的hash函数,而避免使用效率低的MapToPoint函数. 方案的签名与验证在线计算只需1个标量乘、2个指数和1个双线性对运算,因而它是目前效率最高的无证书强代理签名方案.

关键词: 无证书公钥密码系统, 无证书强代理签名, 双线性对

Abstract:

We first formalize the definition and the security model of certificateless strong proxy signatures (CLSPS), and then propose a novel CLSPS scheme from bilinear pairings. It proves that our CLSPS scheme satisfies all the requirements of strong proxy signatures in certificateless public key cryptography. Furthermore, our scheme is more efficient than the existing CLSPS schemes because it requires general cryptographic hash functions instead of MapToPoint function which is inefficient, and the signing algorithm and the verification algorithm online altogether require one scalar multiplication, two exponentiations and one pairing computation.

Key words: certificateless public key cryptography, certificateless strong proxy signature, bilinear pairings

中图分类号: