图视秘密的任意分存

THE ARBITRARY SHARE OF VISUAL SECRETS

在图视秘密分散存储（简称分存）中，任意分存方案可比一般的分存方案更有效地隐蔽秘密信息，因而有着重要的实用意义．本文在Ｓｈａｍｉｒ提出的图机密码的基础上，明确给出了任意分存的概念，并提出了根据（ｋ，ｎ）分存方案构造任意（ｋ，ｎ）分存方案的方法，此外，还给出了由（ｋ，ｋ）分存方案构造任意（ｋ，ｋ）分存方案的简便方法，并证明了其有效性．

In visual secret sharing, arbitrary share is of great importance, for it conceals secret information more effectually than ordinary sharing schemes. Based on the work of Shamir, the definition of arbitrary share and the method to construct an arbitrary k out of n sharing scheme are presented. A simple way is used to build an arbitrary k out of k scheme is also proposed. The validity of the schemes is proved.