计算机应用 ›› 2010, Vol. 30 ›› Issue (8): 2167-2169.

• 信息安全 • 上一篇    下一篇

基于离散对数的代理盲签名方案

柳菊霞1,苏靖枫2   

  1. 1. 洛阳师范学院
    2. 河南城建学院
  • 收稿日期:2010-02-19 修回日期:2010-03-23 发布日期:2010-07-30 出版日期:2010-08-01
  • 通讯作者: 柳菊霞
  • 基金资助:
    河南省教育厅自然科学研究计划项目

Proxy blind signature scheme based on DLP

  • Received:2010-02-19 Revised:2010-03-23 Online:2010-07-30 Published:2010-08-01

摘要: 通过对Tan等人的基于离散对数的代理盲签名方案进行分析,指出该方案不满足不可伪造性,利用一般性的伪造攻击方法,原始签名人和签名接收者都可以伪造一个有效的签名,同时当签名被公开后,代理签名人可以将盲消息的签名和消息签名联系起来,即签名是可追踪的。在此基础上提出了一种新方案,新方案不仅克服了原方案存在的安全缺陷,还具备签名速度快的特性。

关键词: 数字签名, 离散对数, 代理盲签名, 伪造攻击, 非关联性

Abstract: The proxy blind signature scheme based on DLP proposed by Tan et al. was analyzed, and it was found that this scheme does not possess the unforgeability. The original signer and the receiver could both forge a valid proxy blind signature for any message. At the same time, the proxy signer could make a linkage between a message signature and the corresponding blind message signature, which was called linkability. So an improved proxy blind signature scheme was proposed in this paper, which can not only resolved the security problems existing in the original scheme, but also has high efficiency.

Key words: digital signature, Discrete Logarithm Problem(DLP), proxy blind signature, forgery attack, unlinkability