无可信中心的(t,k)门限RSA数字签名体制  

Scheme for (t, k) threshold RSA signature without a trusted center

作　　者：王明文[1] 朱清新[1] 卿利[1] 廖勇[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,四川成都610054

出　　处：《华中科技大学学报（自然科学版）》2006年第6期33-35,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划资助项目(2003AA1Z2210).

摘　　要：提出了一种新的不需要可信中心的门限数字签名方案.在k个成员组成的群组中,只有t个或t个以上成员才能够代表群组签名,而少于t个成员则不能代表群组签名.方案基于Boneh等学者的分布式RSA密钥产生协议和Shamir秘密共享方案而构建.签名过程分为四个阶段:系统初始化、生成个体签名、生成群签名以及签名验证.在系统的初始化阶段不需要可信中心的参与,并且个体签名的生成、群签名的生成和验证都可以方便地实现.通过对方案的安全性分析显示,个体签名和群签名都是不可伪造的,并且在整个签名过程中都没有系统秘密信息的泄漏.A scheme for （t, k） threshold signature without a trusted center was presented. Only t or more group members can generate signatures on behalf of a group with k members, while any t or fewer members cannot do the same thing. The scheme was constructed on the basis of Boneh et al. ＇s scheme for efficient generation of shared RSA keys and Shamir＇s perfect secret sharing scheme. The signature process included four phases： system initialization, individual signature generation, group signature generation and signature verification. A trusted center in the phase of system initialization did not need. Both the generation of the individual signature and the generation and verification of the group signature can he easily implemented. Results of the security analysis showed that it was impossible for the adversary to forge the individual signature and group signature. There was no secret information leakage during the total signature process.

关 键 词：数字签名 门限方案 分布式协议 秘密共享 

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