(k, n)异或视觉密码的一般性研究
doi: 10.3724/SP.J.1146.2012.01719
On the Generality of (k, n) XOR-based Visual Cryptography Scheme
-
摘要: 通过研究(k, n)异或视觉密码像素扩展度最优的必要条件，该文提出一种由基矩阵生成(k, n)异或视觉密码的方法，并从理论上证明了该方法适合2kn的(k, n)异或视觉密码，在此基础上构造了秘密分享和恢复算法。实验结果表明，该文方案可以有效地减小像素扩展度，且能够实现秘密图像的完全恢复。
-
关键词:
- 异或视觉密码 /
- (k, n)门限结构 /
- 像素扩展度最优的必要条件 /
- 完全恢复
Abstract: The necessary condition of the optimal pixel expansion is given and proved in (k, n) XOR-based Visual Cryptography Scheme (XVCS). A new method is designed for constructing (k, n)-XVCS by use of basis matrices. The method is proved to be suitable for (k, n)-XVCS with 2 kn. Based on the above results, the secret sharing and recovering algorithms are proposed. The experimental results show that the pixel expansion can be decreased efficiently. Furthermore, the secret images can be recovered perfectly. -
计量
- 文章访问数: 2386
- HTML全文浏览量: 121
- PDF下载量: 814
- 被引次数: 0
下载:
