中文摘要：

提出了一种有效的适用于彩色图像的秘密共享方案。首先对彩色图像进行压缩,然后利用Shamir的（k,n）门限思想将压缩的彩色图像分为n个影子图像,利用收到的k（k≤n）个影子图像恢复原始的彩色图像。该方案克服了彩色图像大数据量的缺点,在保证恢复图像质量的前提下,将影子图像的尺寸减小为原图像的1/2k,将所传输数据量缩减为原图像的1/6k,不仅大量节省了图像的存储空间,同时也缩减了图像的传输时间。实验结果证明了该方案的可行性。

英文摘要：

This paper proposes an effective color image secret sharing scheme. Firstly, the color image is com- pressed, and then the compressed color image is spited into n shadows images by using Shamir （k, n） -threshold scheme, with only k （k ~ n）shadows being required to construct the original color image. This scheme can not only overcome the shortcoming of large amount of data in color image, but also reduce respectively the size of each shad- ow to 1/2k and the transmitted data quantity to 1/6k of the original color image. Therefore, the scheme can save the storage space and the required transmission time. Experimental results prove the feasibility of this scheme.