计算机工程 ›› 2013, Vol. 39 ›› Issue (2): 130-136.doi: 10.3969/j.issn.1000-3428.2013.02.026

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

一个高效的无证书盲签名方案

黄茹芬,农 强,黄振杰   

  1. (漳州师范学院计算机科学与工程系,福建 漳州 363000)
  • 收稿日期:2012-03-26 修回日期:2012-05-14 出版日期:2013-02-15 发布日期:2013-02-13
  • 作者简介:黄茹芬(1963-),女,副教授、硕士,主研方向:密码学,网络安全;农 强,讲师、硕士;黄振杰,教授、博士
  • 基金项目:
    国家自然科学基金资助项目(61170246);福建省自然科学基金资助项目(2012J01295)

An Efficient Certificateless Blind Signature Scheme

HUANG Ru-fen, NONG Qiang, HUANG Zhen-jie   

  1. (Department of Computer Science and Engineering, Zhangzhou Normal University, Zhangzhou 363000, China)
  • Received:2012-03-26 Revised:2012-05-14 Online:2013-02-15 Published:2013-02-13

摘要: 结合无证书签名和盲签名的特点,提出一个新的无证书盲签名方案,以简化传统公钥密码体制的密钥管理过程,解决基于身份的公钥密码体制存在的密钥托管问题。分析结果表明,该方案在随机预言机模型、q强Diffie-Hellman困难假设和逆计算Diffie-Hellman困难假设下满足盲性、不可追踪性和不可伪造性,且签名的产生和验证过程仅需一个对运算,具有较高的效率。

关键词: 无证书签名, 盲签名, inv-CDH问题, q-SDH问题, 双线性映射, 不可伪造性, 盲性

Abstract: In order to simplify the certificate management process of the traditional public key system and solve the problem about private key escrow in the identity-based public key system, this paper proposes a new certificateless blind signature scheme which combines certificateless signature and blind signature. Analysis result shows that the new scheme is blind, untraceability and unforgeability in random oracle model and under the q-strong Diffie-Hellman complexity assumption and the inversed Diffie-Hellman complexity assumption. The signing algorithm does not require any pairing computation and the verification algorithm only needs a pairing computation, so that the scheme proposed is more efficient.

Key words: certificateless signature, blind signature, inv-CDH problem, q-SDH problem, bilinear mapping, unforgeability, blindness

中图分类号: