Grouped k-threshold random grid-based visual cryptography scheme
Xiaoli Zhuo, Xuehu Yan, Wei Yan

TL;DR
This paper introduces a new hierarchical threshold visual cryptography scheme that significantly improves contrast, enabling better visual quality in secret image sharing without pixel expansion.
Contribution
It proposes a novel grouped threshold paradigm for random grid-based visual cryptography, achieving the highest contrast values documented to date.
Findings
Achieves hierarchical contrast with optimal intra-group recovery.
Introduces a new contrast calculation formula for the paradigm.
Demonstrates superior contrast through theoretical analysis and experiments.
Abstract
Visual cryptography schemes (VCSs) belong to a category of secret image sharing schemes that do not require cryptographic knowledge for decryption, instead relying directly on the human visual system. Among VCSs, random grid-based VCS (RGVCS) has garnered widespread attention as it avoids pixel expansion while requiring no basic matrices design. Contrast, a core metric for RGVCS, directly determines the visual quality of recovered images, rendering its optimization a critical research objective. However, existing RGVCSs still fail to attain theoretical upper bounds on contrast, highlighting the urgent need for higher-contrast constructions. In this paper, we propose a novel sharing paradigm for RGVCS that constructs -threshold schemes from arbitrary -threshold schemes , termed \emph{-grouped RGVCS}. This paradigm establishes…
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.
