J4

• 研究论文 • 上一篇    下一篇

一个改进的无证书签名方案

明洋1;詹阳2;王育民2;庞辽军2
  

  1. (1. 长安大学 信息工程学院,陕西 西安 710064;
    2. 西安电子科技大学 综合业务网理论及关键技术国家重点实验室,陕西 西安 710071)
  • 收稿日期:2007-06-05 修回日期:1900-01-01 出版日期:2008-12-20 发布日期:2008-12-20
  • 通讯作者: 明洋

Improved certificateless signature scheme

MING Yang1;ZHAN Yang2;WANG Yu-min2;PANG Liao-jun2
  

  1. (1. School of Information Engineering, Chang’an Univ., Xi’an 710064, China;
    2. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi’an 710071, China)
  • Received:2007-06-05 Revised:1900-01-01 Online:2008-12-20 Published:2008-12-20
  • Contact: MING Yang

摘要: 针对Yap-Heng-Goi无证书签名方案不能抵抗公钥替换攻击的缺陷,基于双线性对提出了一个改进的方案.使用短签名方案来生成用户的部分私钥,并直接和用户选取的秘密值构成签名私钥,在签名算法中使用了两个Hash函数来生成签名.由此签名的验证能够隐含地验证公钥的正确性,从而解决了Yap-Heng-Goi方案的安全问题,同时签名算法不需要对的计算,验证算法仅仅需要3个对的计算.安全性分析表明,在随机预言机模型中,计算性Diffie-Hellman假设下,这种方案能够抵抗适应性选择消息攻击下的存在性伪造.

关键词: 双线性对, 无证书签名, 随机预言机模型

Abstract: Based on the bilinear pairing, an improved certificateless signature scheme is presented to overcome the Yap-Heng-Goi scheme’s drawback that it is vulnerable to public key replacement attacks. This proposed scheme uses a short signature to generate the user’s partial private key which straightly constructs the private key with the secret value chosen by the user. Two Hash functions are used to generate signatures in the signature algorithm. The correction of the public key can be checked implicitly by verifying the signature, and thus the Yap-Heng-Goi scheme’s security problem is solved. In the proposed scheme, no pairing computation is needed in the signing algorithm and the verification algorithm requires only three pairings computations. A security analysis shows that the proposed scheme is proved secure against existential forgery on an adaptively chosen message attack under the assumption of Computational Diffie-Hellman in the random oracle model.

Key words: bilinear pairing, certificateless signature, random oracle model

中图分类号: 

  • TN918.1