作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (20): 164-166. doi: 10.3969/j.issn.1000-3428.2008.20.060

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

基于身份的无可信中心门限环签名方案

李 虓,何明星,罗大文   

  1. (西华大学数学与计算机学院,成都 610039)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-10-20 发布日期:2008-10-20

ID-based Threshold Ring Signature Scheme Without Trusted Party

LI Xiao, HE Ming-xing, LUO Da-wen   

  1. (School of Mathematics and Computer Engineering, Xihua University, Chengdu 610039)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-10-20 Published:2008-10-20

摘要: 已有的多数基于身份的门限环签名方案不能克服密钥托管问题,而能克服密钥托管问题的基于身份的无可信中心签名方案存在效率不高的缺陷。该文利用分布式秘密共享思想和双线性对,提出一个有效的基于身份的无可信中心门限环签名方案。该方案能保证不诚实的PKG无法伪造环签名,有效避免了密钥托管问题。同时该方案只需要2次对运算,比已有的门限环签名方案和无可信中心的基于身份的签名方案效率更高。

关键词: 环签名, 秘密共享, 门限环签名, 双线性对, 密钥托管

Abstract: Most previous ID-based threshold ring signatures cannot give over the problem of key escrow. Whereas, the ID-based ring signatures which can get over the problem of key escrow have some drawback of low efficiency. In this paper, the thought of distributed secret sharing and bilinear parings are adopted, and an efficient ID-based threshold ring signature scheme without a trusted party is proposed. The proposed scheme can ensure that the dishonest Private Key Generator(PKG) cannot impersonate the ring members to sign a message. The problem of key escrow can be avoided availably. The proposed scheme only needs two bilinear parings. It is more efficient than the previous schemes of ID-based threshold ring signature and ID-based signature without trusted party.

Key words: ring signature, secret sharing, threshold ring signature, bilinear parings, key escrow

中图分类号: