线性秘密共享体制的一般构造

General construction of linear secret sharing scheme

利用单调张成方案讨论了线性秘密共享体制方案的构造,给出了目标向量为e=(100)时任意一个接入结构所对应的单调张成方案的矩阵,并给出了相应的例子。最后利用乘性线性秘密共享体制的定义,借助diamond运算给出了判断一个线性秘密共享体制是否为乘性的充要条件。

This paper studies the constructions of linear secret sharing scheme by monotone span program,and gives the corresponding matrixes of monotone span program when the target vector is e=（1,0,…,0）.The examples are presented.At last, it gives a sufficient and necessary condition of deciding the multiplication of a linear secret sharing scheme.