一个有效的(t,n)门限多重秘密共享体制  

An Efficient(t,n) Threshold Multi-Secret Sharing Scheme

作　　者：庞辽军[1] 柳毅[1] 王育民[1] 

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

出　　处：《电子学报》2006年第4期587-589,共3页Acta Electronica Sinica

基　　金：国家973基础研究发展规划重大项目(No.G1999035805)

摘　　要：针对Chien-Jan-Tseng体制计算量大以及Yang-Chang-Hwang体制公开信息量大的不足,利用双变量单向函数提出了一个新的(t,n)门限多重秘密共享体制.通过一次秘密共享过程就可以实现对任意个秘密的共享,而参与者秘密份额的长度仅为一个秘密的长度.在秘密重构过程中,每个合作的参与者只需提交一个由秘密份额计算的伪份额,而不会暴露其秘密份额本身.本文体制结合了现有体制的优点并避免了它们的缺点,是一个实用、有效的体制.With the two-variable one-way function, a novel （t, n） threshold multi-secret sharing scheme was presented to overcome Chien-Jan-Tseng scheme＇ s drawback about a large amount of computation and Yang-Chang-Hwang scheme＇ s drawback about lots of public values. Multiple secrets can be shared in one sharing session, and each participant＇s secret shadow is as long as each of the shared secrets. In the recovery phase,each cooperative participant only needs to submit a pseudo-shadow instead of his secret shadow,and his secret shadow cannot be disclosed. Integrating the advantages of the existing schemes and avoiding their disadvantages, so this scheme is a practical and efficient secret sharing scheme.

关 键 词：门限体制 秘密共享 多重秘密共享 

分 类 号：TN918.4[电子电信—通信与信息系统]