一种新的彩色可视秘密共享方案

提出了一种基于线性方程组求解的彩色可视秘密共享方案。该方案把一幅图像秘密地分成n幅共享图像，使得任意k个或更多的共享能够恢复秘密图像，而任意少于k个共享却得不到有关原始图像的任意信息。另外，每个共享图像与原始图像有着同样大小，而且恢复图像和秘密图像完全一样，没有任何失真。所以它是一种理想、完备的（k，n）门限方案，适用于把黑白、灰度、彩色图像作为秘密进行共享。

A New Color Visual Secret Sharing Scheme

Proposes a color visual secret sharing scheme based on solving the linear equations.The scheme allows to encode an image into n shared images so that any k or more shares can recover the secret image,but any k-1 or fewer of them gain no information about the original image.In addition,each shared image has the same size that the original one,and the recovered image is exactly the same than the secret image such that ther is no loss of the secret.Thus,it is an ideal and perfect(k,n) threshold scheme to share b&w,gray-level or color images in a secret way.