可验证的(t,n)门限秘密共享方案及其安全性  

Verifiable(t,n) Threshold Secret-Sharing Scheme and Its Security

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

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071 [2]西北工业大学计算机学院,陕西西安710072

出　　处：《华南理工大学学报（自然科学版）》2007年第1期102-105,共4页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家"973"计划项目(G1999035805);国家自然科学基金资助项目(50479055)

摘　　要：为了在无可信中心存在的情况下将一个秘密在一组参与者之间实现共享,并且防止参与者间的相互欺骗,提出了一种动态的、可验证的(t,n)门限秘密共享方案.在该方案中,各参与者的秘密份额由所有参与者共同协商,而不是由秘密分发者进行分配.因此,在秘密分发过程中,秘密分发者只需计算一些公开信息,而无需向各参与者传递任何信息.在秘密重构过程中,每个合作的参与者只需向秘密计算者提交一个由秘密份额计算的伪份额,且秘密计算者能够验证伪份额的有效性.方案的安全性是基于离散对数问题的难解性.In order to share a secret among a group of participants without a trusted center and to prevent the participants from cheating each other, a dynamic and verifiable （t, n） threshold secret-sharing scheme is proposed. In this scheme, the secret shadow of each participant is negotiated by all participants, and the secret dealer does not have to distribute any secret shadow. So, in the process of secret distribution, the dealer is only asked to compute some public values without sending any information to each participant. Furthermore, in the process of secret recovery, each participant of a cooperative only submits a pseudo-shadow computed via the secret shadow to the secret computer, and anyone is allowed to check the validity of the pseudo-shadow. The security of the can be effectively guaranteed due to the difficulty in solving the discrete logarithm problem.

关 键 词：数据安全 秘密共享 门限方案 验证 

分 类 号：TP918[自动化与计算机技术]