一种二值图像的闽值可视密码方案

摘要

目前提出的许多关于二值可视密码方案的论文都致力于研究在可视秘密共享方案里如何使像素扩展比较小或恢复图像的对比度比较高的问题.基于Shamir的秘密共享方案的思想,提出一种新的二值图像(k,n)-VCS可视密码方案.该方案利用二元域上线性方程组解的特征及多层(k,k)-VCS构造基础矩阵S~0,S~1,给出一个强的访问结构,从而获得(k,n)-VCS可视密码方案更小的像素扩展.%Most recent papers about binary visual cryptography schemes are dedicated to study a higher contrast of recovered images or a smaller share size in visual secret sharing schemes.This paper proposes a new binary (k,n)-VCS based on the secret sharing schemes.A strong access structure is given which uses the feature of the solution of a system of linear equations over the binary field and hierarchical method for constructing basis binary matrices S~0,S~1,and the (k,n)-VCS is obtained and in almost all the case a much smaller pixel expansion is gained from this method.