首页 | 本学科首页   官方微博 | 高级检索  
     

基于身份的无可信中心门限环签名方案
引用本文:李虓,何明星,罗大文.基于身份的无可信中心门限环签名方案[J].计算机工程,2008,34(20):164-166.
作者姓名:李虓  何明星  罗大文
作者单位:西华大学数学与计算机学院,成都,610039
基金项目:国家自然科学基金,四川省教育厅资助项目
摘    要:已有的多数基于身份的门限环签名方案不能克服密钥托管问题,而能克服密钥托管问题的基于身份的无可信中心签名方案存在效率不高的缺陷。该文利用分布式秘密共享思想和双线性对,提出一个有效的基于身份的无可信中心门限环签名方案。该方案能保证不诚实的PKG无法伪造环签名,有效避免了密钥托管问题。同时该方案只需要2次对运算,比已有的门限环签名方案和无可信中心的基于身份的签名方案效率更高。

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

ID-based Threshold Ring Signature Scheme Without Trusted Party
LI Xiao,HE Ming-xing,LUO Da-wen.ID-based Threshold Ring Signature Scheme Without Trusted Party[J].Computer Engineering,2008,34(20):164-166.
Authors:LI Xiao  HE Ming-xing  LUO Da-wen
Affiliation:(School of Mathematics and Computer Engineering, Xihua University, Chengdu 610039)
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.
Keywords:ring signature  secret sharing  threshold ring signature  bilinear parings  key escrow
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号