本文主要研究实现非门限存取结构的线性密钥共享方案。首先为任意的非门限存取结构构造了最优线性码;提出了使用最优线性码构造秘密分块最少的线性密钥共享方案;讨论了这些线性密钥共享方案的性质;给出了单调张成方案中生成矩阵行和列的下界。从理论上解决了实现非门限存取结构线性密钥共享方案的构造,分析了它的主要性质。
In this paper, we research on linear secret sharing scheme for realizing non-threshold access structure. We construct firstly optimal linear code for arbitrary non-threshold access structure, then construct linear secret sharing scheme with the least shares from optimal linear code, and analyze properties of these schemes, finally, give the lower bound of generating matrix's row and column in monotone span program. We realize theoretic construction of optimal linear secret sharing scheme for arbitrary non- threshold access structure, and give their peoperties.