Towards Shift Tolerant Visual Secret Sharing Schemes
Daoshun Wang, Lin Dong, Xiaobo Li

TL;DR
This paper introduces a (2, n) visual secret sharing scheme that tolerates shifts between shares, maintaining image contrast and functionality even with misalignments, at the cost of increased pixel expansion.
Contribution
It proposes a novel shift-tolerant (2, n)-VSS scheme using duplication and concatenation of matrix rows or columns, enhancing robustness against misalignment.
Findings
Contrast remains high with perfect alignment.
Scheme tolerates horizontal and vertical shifts.
Pixel expansion increases compared to traditional schemes.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Advanced Image and Video Retrieval Techniques · Digital Image Processing Techniques
