计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (12): 137-139.

• 网络、通信与安全 • 上一篇    下一篇

一个新型可验证的门限盲签名方案

康斌 余昭平   

  1. 解放军信息工程大学电子技术学院203教研室 解放军信息工程大学电子技术学院203教研室
  • 收稿日期:2006-05-24 修回日期:1900-01-01 出版日期:2007-04-20 发布日期:2007-04-20
  • 通讯作者: 康斌

A New Verifiable Threshold Blind Signature Scheme

  • Received:2006-05-24 Revised:1900-01-01 Online:2007-04-20 Published:2007-04-20

摘要: 张方国等人2001年提出了基于椭圆曲线的数字签名与盲签名方案,我们在此基础上提出了一种基于椭圆曲线可验证的新型门限盲签名方案。该方案具有可验证性、盲性、鲁棒性、不可伪造性等安全特征。其安全性不仅依赖于椭圆曲线离散对数的分解难度,而且依赖于椭圆曲线的选取和椭圆曲线密码体制。比较和分析可知该方案的计算与通信复杂度均略低于郑卓等人的方案。

关键词: 门限签名, 盲签名, 离散对数, 椭圆曲线

Abstract: Zhang fang-guo puts forward a signature scheme and blind signature scheme based on the elliptic curve in 2001. On this foundation ,we proposed a new verifiable threshold blind signature scheme based on the elliptic curve. This scheme have several security characteristics, such as verifiability, blindness, robustness and non-forgery.etc. Its security depends not only on the elliptic curve discrete logarithms but also on the choice of the elliptic curve and its system. By analyzing the scheme, we conclude that its computational complexity and communication complexity is lower than Zhengzhuo’s scheme.

Key words: threshold signature, blind signature, discrete logarithms, elliptic curve