arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.2364cs.CR
收藏

移动容忍的可视秘密共享方案

Towards Shift Tolerant Visual Secret Sharing Schemes

Daoshun Wang, Lin Dong, Xiaobo Li

摘要:

在(k,n)可视秘密共享(VSS)方案中,当k个或多个参与者将各自的秘密份额打印在一张纸上并将其堆叠在一起时,秘密图像可以被可视地重构。没有秘密透露少于k股。全息图的对准对于重建秘密图像的视觉质量是重要的。在VSS方案中,原始秘密图像的每个像素在共享图像中被扩展为m个子像素。如果共享图像被打印在与原始秘密图像相同大小的纸上,则仅比原始秘密中的子像素小m倍的子像素的对准或配准可能是麻烦的。Liu等人[4]已经注意到了这个对齐问题,并观察到即使在水平方向上没有精确地记录份额时,秘密图像的一些信息仍然可能被泄露。Yang等人[9]介绍了一种通用方法,用于在原始秘密图像在形状精度上具有一定程度冗余的情况下,使用大小块来构造失准容忍(k,n)-VSS方案。在本文中,我们提出了一个(2,n)-VSS计划,允许在水平方向和垂直方向的份额之间的相对移动。当两部分完全对齐时,重建图像的对比度与传统的VSS方案相当。当存在移位时,重建图像的平均对比度高于传统的VSS方案,并且该方案在图像中存在很少形状冗余的情况下仍然可以工作。代价是我们的方法涉及更大的像素扩展。我们方案的基本构建块是基本矩阵的某些行或列的重复和串联。这个看似简单但非常强大的构造原理可以很容易地用于创建更一般的(k,n)-VSS方案。

英文摘要:

In (k, n) visual secret sharing (VSS) scheme, secret image can be visually reconstructed when k or more participants printing theirs shares on transparencies and stack them together. No secret is revealed with fewer than k shares. The alignment of the transparencies is important to the visual quality of the reconstructed secret image. In VSS scheme, each pixel of the original secret image is expanded to m sub-pixels in a share image. If a share image is printed on paper with the same size as the original secret image, the alignment or the registration of the sub-pixels, which is only m times smaller than that in the original secret, could be troublesome. Liu et al. [4] has noticed this alignment problem and observed that some information of the secret image may still be revealed even when the shares are not precisely registered in the horizontal direction. Yang et al. [9] introduced a general approach to construct a misalignment tolerant (k, n)-VSS scheme using big and small blocks for the situation where the original secret image has a certain degree of redundancy in shape accuracy. In this paper, we propose a (2, n)-VSS scheme that allows a relative shift between the shares in the horizontal direction and vertical direction. When the shares are perfectly aligned, the contrast of the reconstructed image is equal to that of traditional VSS shceme. When there is a shift, average contrast in the reconstructed image is higher than that of the traditional VSS scheme, and the scheme can still work in the cases where very little shape redundancy presents in the image. The trade-off is that our method involves a larger pixel expansion. The basic building block of our scheme is duplication and concatenation of certain rows or columns of the basic matrices. This seemingly simple but very powerful construction principle can be easily used to create more general (k, n)-VSS schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑