一种基于秘密分享的高质量(k,n)可视加密算法

(k,n)可视加密算法是一种重要的信息隐藏算法。应用Shamir秘密分享的概念，将一幅二进制秘密图像隐藏在n幅分享图像中，通过在分享过程中增加随机性控制，保证生成的分享图像是接近噪声图像的无意义图像。从n幅无意义分享图像中，任意选取k幅分享图像，使用拉格朗日插值可提取秘密图像。该算法应用Shamir秘密分享来实现(k,n)可视加密，不需要码书，不会造成无限制的像素扩展。实验结果显示，该算法能实现(k,n)可视加密，提取秘密图像的提取正确率能保证100%。

A High Quality (k,n) Visual Cryptography Based on Secret Sharing

(K,n) visual cryptography is an important data hiding algorithm. Using Shamir''s secret sharing, a binary secret image can be shared into n meaningless shares, in order to make the generated shares more like noise images, adding the randomness within the process of sharing. Picking any k shares from n meaningless shares, the secret image can be revealed by using Lagrange interpolation. This paper applies Shamir''s secret sharing to realize a (k,n) visual cryptography, and this method neither requires code book nor suffers from pixel expansion. Experimental results show the proposed method can realize a (k,n) visual cryptography, and correct decoding rate (CDR) of revealed secret image can be guaranteed.