计算机应用 ›› 2009, Vol. 29 ›› Issue (11): 2990-2992.

• 信息与网络安全 • 上一篇    下一篇

一种基于身份的高效环签名方案

王文强1,陈少真2   

  1. 1. 解放军信息工程学院信息研究系
    2. 信息工程大学 信息工程学院
  • 收稿日期:2009-05-15 修回日期:2009-07-08 发布日期:2009-11-26 出版日期:2009-11-01
  • 通讯作者: 王文强
  • 基金资助:
    国家自然科学基金重点项目;国家自然科学基金资助项目;国家高技术研究发展计划

Efficient identity-based ring signature scheme

Wen-qiang WANG,Shao-zhen CHEN   

  • Received:2009-05-15 Revised:2009-07-08 Online:2009-11-26 Published:2009-11-01
  • Contact: Wen-qiang WANG
  • Supported by:
    ;National Natural Science Foundation of China;Chinese National Programs for High Technology Research

摘要: 通过巧妙设置公共参数,提出一种新的基于身份的高效环签名方案,利用签名参数和身份的线性关系减少验证时双线性对的个数。在标准模型下证明其能抵抗签名伪造攻击,且具有无条件匿名性。与现有标准模型下基于身份的环签名方案相比,对于n个成员的环,签名验证仅需要2个双线性对运算,因此签名验证效率有很大提高。

关键词: 私钥生成中心, 标准模型, 双线性对, 计算性Diffie-Hellman假设

Abstract: A new efficient identify-based ring signature scheme was proposed by skillfully setting public parameters. It can reduce the bilinear pairings needed in verifying phase by using liner relations between signature parameters and identify. It is proved to be unforgeable in the standard model, and is unconditionally anonymous. Compared with the existing attribute-based ring signature scheme, for a ring of n members, the signature only requires 2 pairings to verify. Thus the efficiency of verifying the signature improves greatly.

Key words: Private Key Generator (PKG), standard model, bilinear pairing, computational Diffie-Hellman assumption