计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (11): 122-123.

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

基于双线性对的盲签名方案

向新银1,郝会兵2,党荣香1   

  1. 1.西安财经学院 研究生部,西安 710061
    2.孝感学院 数学系,河北 孝感 432100
  • 收稿日期:2007-08-02 修回日期:2007-11-02 出版日期:2008-04-11 发布日期:2008-04-11
  • 通讯作者: 向新银

Blind signature scheme based on bilinear pairings

XIANG Xin-yin1,HAO Hui-bing2,DANG Rong-xiang1   

  1. 1.School of Graduate,Xi’an University of Finance and Economics,Xi’an 710061,China
    2.Department of Mathematics,Xiaogan University,Xiaogan,Hubei 432100,China
  • Received:2007-08-02 Revised:2007-11-02 Online:2008-04-11 Published:2008-04-11
  • Contact: XIANG Xin-yin

摘要: 提出了一种基于双线性对的新的高效盲签名方案,与已提出的盲签名方案进行比较,新方案能克服已提出方案的可伪造性和可否认性等可安全性缺陷,并且该方案具有更少的双线性对运算量以及效率高、通信量低等特点。

关键词: 盲签名, 双线性对, Weil对

Abstract: A new efficient blind signature scheme based on bilinear pairings is proposed,compared with those proposed schemes.The new scheme can overcome the security drawbacks such as forgeability and deniability,which has the properties of high efficiency and low computation complexity etc.

Key words: blind signature, bilinear pairings, Weil pairings