检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张文芳[1] 何大可[1] 王宏霞[1] 王小敏[1]
机构地区:[1]西南交通大学信息科学与技术学院
出 处:《西南交通大学学报》2007年第4期461-467,共7页Journal of Southwest Jiaotong University
基 金:四川省青年科技基金资助项目(07JQ0060)
摘 要:在分析王斌和李建华的无可信中心门限签名方案(王-李方案)以及X ie-Yu改进方案安全缺陷的基础上,提出了一种新的具有可追查性的抗合谋攻击(t,n)门限签名方案;对新方案的安全性进行了分析,并与现有方案的效率进行了比较.结果表明:该方案不仅能够从根本上抵抗合谋攻击和伪造签名攻击,而且在保证匿名性的前提下,能够真正实现签名成员身份的可追查性,同时通过构造安全的分布式密钥生成协议保证群私钥的不可知性,因此比现有方案具有更高的安全性.此外,新方案的计算量和通信量与王-李方案接近,但优于X ie-Yu方案.A novel conspiracy attack immune (t, n) threshold signature scheme with traceability was proposed to overcome the weaknesses of the Wang-Li scheme and the improved Xie-Yu scheme. The security of this scheme was analyzed, and a comparison between efficiencies of the proposed scheme and the two schemes was made. The results show that the proposed scheme can not only resist conspiracy attacks and forgery attacks essentially, but also provide anonymity and traceability simultaneously. In addition, it can realize the unknowability of group's secret by constructing a secure distributed key generation protocol. As a result, the proposed scheme is more secure than the two schemes. Furthermore, its computational complexity and communication cost are lower than the improved Xie-Yu scheme.
关 键 词:门限签名 合谋攻击 伪造签名攻击 可追查性 可验证秘密共享
分 类 号:TN918.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.239.11