一个有效的理想的多秘密共享方案

摘要

基于单调张成方案,构造了一个有效的理想的多秘密共享方案.在这个方案中,将含有n个参与者的集合分割成若干个参与者子集,用来建立多重访问结构.该方案具有防欺诈性,即某个不诚实的参与者在一次密钥重构中即使得到一些参与者的共享也不能恢复其他密钥.整个方案构造过程计算量小,只用到了简单的线性运算.与文献[4,9]相比,有效地避免了模方幂等高复杂度的运算以及解线性方程组的步骤,是一个较为实用的且理想的线性的多秘密共享方案.%This paper presented an efficient ideal multi-secret sharing scheme based on MSP. This scheme, splitted a set of n participants into several subsets of participants to establish multiple access structures. It was cheat-proof, that was, after a secret was reconstructed by some participants, the dishonest participant could not recover other secrets by using those sharings he obtained. The entire scheme had the advantages of small computational cost, only using simple linear operations. Compared with [4,9] , it avoided high complexity operations like exponentiation, which was a practical linear multi-secret sharing scheme.