一个安全高效的访问结构上的秘密共享方案

基于Shamir的门限方案提出了一个访问结构上的秘密共享方案。一组秘密被若干参与者共享,每个授权子集中的参与者可以联合一次性重构这些秘密,而且参与者秘密份额长度与每个秘密长度相同。该方案可以进行任意多次的共享,而不必更新各参与者的秘密份额。与现有方案不同的是,一次共享过程可以共享多个而不仅仅共享一个秘密,提高了秘密共享的效率并拓宽了秘密共享的应用。分析发现该方案是一个安全、有效的方案。

A Secure and Efficient Secret Sharing Scheme on Access Structures

Based on Shamir's threshold scheme, a secret sharing scheme on access structures is proposed in this paper. Multiple secrets can be shared in each sharing session, and any qualified subset of participants can cooperate to recover these secrets at one time. Participants' secret shadows are as long as each of the shared secrets. At the same time, these shadows can be reused in multiple sharing sessions without being updated. The difference from the existing schemes is that multiple secrets instead of only one secret can be shared in each sharing session, This improves the efficiency of secret sharing and provides great capabilities for many applications. Analysis shows that this scheme is an efficient and computationally secure scheme.