基于Shamir的门限方案、RSA密码体制以及Hash函数,提出了一个新的门限多重秘密共享方案。参与者的秘密份额是由各参与者自己选择,并且只需维护一份秘密份额即可实现对多个秘密的共享,每个参与者也可以是秘密分发者,只要正确选择参数不会影响到各个参与者所共享的秘密安全性。在秘密恢复过程中,秘密恢复者能够验证其它参与者是否进行了欺骗。方案的安全性是基于Shamir的门限方案、RSA密码体制以及Hash函数的安全性。分析结果表明,该方案是一个安全、实用的秘密共享方案。
A new threshold multi-secret sharing scheme is proposed based on Shamir's threshold scheme, RSA cryptosystem aria Hash function. In the scheme, each participant's secret shadow is selected by the participant himself and the shadows don't need to change when the shared secret is renewed. The participant can be work as dealer. Scheme is security without conflict parameters. In the recovery phase, each participant can check whether shadow is true or not. The security of the scheme is the same as that of Shamir's threshold scheme, the RSA cryptosystem and Hash function. Analyses show that this scheme is computationally secure and practical.