为扩展多秘密共享的应用范围,基于Shamir的门限秘密共享方案,提出了一般访问结构上的多秘密共享方案.该方案与现有方案不同的是:一次秘密共享过程可以同时共享任意多个秘密;系统中各个参与者的秘密份额可以重用,其长度等于一个秘密的长度.分析表明,与现有方案相比,该方案降低了秘密分发算法和秘密重构算法的计算复杂度,实现了多个秘密的共享,提高了系统性能.
In order to widen the application of multi-secret sharing schemes, a multi-secret sharing scheme with general access structures was proposed based on Shamir' s threshold secret sharing scheme, in which multiple secrets are shared in each sharing session, and the secret shadow of each participant is reused, with a length as long as that of one shared secret. All these are different from the existing schemes. Analytical results show that, as compared with the existing schemes, the proposed scheme reduces the computational complexity of secret distribution and secret reconstruction algorithms and that it implements the sharing of multiple secrets, thus improving the system performance.