XOR-based Visual Cryptography Schemes
XOR-based Visual Cryptography Schemes
复制标题
DOI：
10.1007/s10623-004-3816-4
复制
发表时间：
2005-10
期刊：
影响因子：
--
通讯作者：
P. Tuyls;H. Hollmann;J. H. Lint;L. Tolhuizen
中科院分区：
文献类型：
--
作者：
P. Tuyls;H. Hollmann;J. H. Lint;L. Tolhuizen
最近的出版物介绍了基于光偏振的视觉加密 (VC) 系统。该VC系统具有良好的分辨率、对比度和色彩特性。在数学上，该VC系统通过异或运算（模二加法）来描述。在本文中，我们研究了与基于 XOR 的 VC 系统相关的阈值视觉秘密共享方案。首先，我们证明不存在具有最佳分辨率和对比度的n方案，并且(2,n)方案等价于二进制码。事实证明，这些方案比基于 OR 的方案具有更好的分辨率。其次，我们为一般的 nschemes 提供了两种显式构造。最后，我们得出基于异或的方案的对比度和分辨率的界限。从这些界限可以看出 fork<n，对比度严格小于 1。此外，边界意味着 Evenka 的基于 XOR 的 kout 方案与 oddk 的方案根本不同。
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has goodresolution, contrast and colour properties.Mathematically, the VC system is described by the XOR operation (modulo two addition). In this paper we investigate Threshold Visual Secret Sharing schemes associated to XOR-based VC systems. Firstly, we show thatnout ofnschemes with optimal resolution and contrast exist, and that (2,n) schemes are equivalent to binary codes. It turns out that these schemes have much better resolution than their OR-based counterparts. Secondly, we provide two explicit constructions for generalkout ofnschemes. Finally, we derive bounds on the contrast and resolution of XOR-based schemes. It follows from these bounds that fork<n, the contrast is strictly smaller than one. Moreover, the bounds imply that XOR-basedkout ofnschemes for evenkare fundamentally different from those for oddk.