一个(t,n门限签名-(k,m门限验证的群签名方案  

A Group Signature Scheme with a (t,n) Threshold Signature and a (k,m) Threshold Verification

作　　者：庞辽军[1] 李慧贤[1] 王育民[1] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,西安710071

出　　处：《计算机科学》2006年第11期76-78,共3页Computer Science

基　　金：国家973项目资助课题(G1999035805);"十五"军事通信技术预研项目资助课题(Y1010122)

摘　　要：基于离散对数问题,提出了一个(t,n)门限签名-(k,m)门限验证的群签名方案。在该方案中,n个签名者中至少t个合作可以生成有效的群签名;而m个验证者中至少k个合作可以验证签名的有效性。参与者的公、私钥以及群公钥由参与者共同协商,无需可信中心参与;参与者之间的信息可以以明文形式传送;能够抵御内部相互欺诈和外部攻击。方案的安全性是基于离散对数问题的难解性。Based on the discrete logarithm problem, a group signature scheme with a （t, n） threshold signature and a （k, m） threshold verification is proposed in this paper. Only t or more of n signers can sign a message correctly, and only k or more of m verifiers can verify the validity of the signature Each participant＇s public key and private key, and the group public key are negotiated among all participants with no trusted party required. And at the same time, the messages between any two participants can be transmitted in clear text. This schemeprovides the capability of detecting cheating and identifying the cheater. The security of this scheme is based on the difficulty of solving the discrete logarithm problem.

关 键 词：数字签名 门限数字签名 离散对数 

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