一种改进的无需可信中心的(t,n)门限签名方案  

An Improved (t,n)Threshold Signature Scheme Without Trusted Party

作　　者：施荣华[1] 胥磊[1] 周玉[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《小型微型计算机系统》2007年第5期816-818,共3页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60173041)资助;湖南省自然科学基金项目(02JJY2094)资助

摘　　要：1995年,Li C,Hwang T,Lee N提出两个门限群签名方案:一个需要可信任中心,另一个不需要.本文讨论的是后一方案(以下简称为LHL门限群签名方案或LHL方案)[1].本文针对王贵林等指出LHL签名方案的两个安全缺陷:不具有可验证性,导致签名的可伪造;不能同时具备匿名性和可追查性[2],提出了一种改进的方案.改进后的方案可以防止秘密分享者的欺诈行为,因而具有可验证性,且匿名性和可追查性能同时具备,因而比原方案更具安全性.In 1995, Li C, Hwang T, Lee N proposed two threshold signature schemes： one with Trusted Party and the other without Trusted Party. This paper will discuss the second scheme （name as LHL threshold signature scheme or LHL scheme）. Wang Gui-lin pointed out two security limits of LHL threshold group signature scheme ：the existence of signature forgery attack and the failure to possess anonymity and traceability at the same time. This paper proposes an improved scheme base on LHL scheme. The improved scheme can prevent cheating behaviors of the people who shared system secrets. The scheme has the features including verification, anonymity and traceability at the same time, So the new scheme is more secure than the old scheme.

关 键 词：门限签名 可验证性 匿名性 可追查性 可信中心 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]