基于访问树的多秘密共享方案

A Muli-secrets Sharing Scheme Based on Access Tree

该文基于访问树提出了一个多秘密共享方案，弥补了（t，n）门限方案中参与者身份地位必须相同的缺点，使得在秘密分发和恢复时更加灵活。在该方案中参与者的子秘密由每个参与者自己选取，其子秘密的信息可以通过公开的信道发送给秘密分发者，每个参与者只需维护一个子秘密就可以实现对任意多个秘密的共享。分析表明，该方案是一个安全、实用的秘密共享方案。

This paper proposes a multi-secrets sharing scheme based on the access tree, which makes up the weakness of the the participants＂ position being the same in the （t,n） theshold scheme. The scheme is more flexible when the secrets are distributed and reconstructed. The sub-secrets of participants are chosen by themselves and are submitted to secret dealer through public channel. In the scheme, each participant only maintains one secret but can share several secrets with other participants. Analyses show that this scheme is secure and practical.