1. On Multi-image Random Grids by Arbitrary Transformations
- Author
-
Neil Buckley, Atulya Kumar Nagar, and Emanuele Lindo Secco
- Subjects
Visual cryptography ,Secret sharing ,Multi-image random grids ,Information technology ,T58.5-58.64 ,Electronic computers. Computer science ,QA75.5-76.95 - Abstract
Abstract Random grids are a method for visual secret sharing, whereby a secret image is encoded into a number of shares, each of which is maximally entropic. There has been growing interest in hiding multiple images in a scheme, such that additional images are revealed by stacking the shares in different ways. This paper proposes a metaheuristic method for generating schemes that allow for a wide range of transformations, or even combinations thereof, to reveal an arbitrary number of secret images. Up to 10 multi-secrets are shown in this paper, as well as hiding multiple secrets in a general access structure. To remove noise from these schemes an algorithm is proposed to extract the information from the noise, and in all cases, relative contrasts are given. In one example, six images are hidden in two shares, such that the mean relative contrast under OR-stacking is 0.152, under XOR-stacking 0.278, and with noise removed, it is 0.74. In an example hiding 10 images in two shares, the values are respectively 0.136, 0.206 and 0.679, respectively.
- Published
- 2024
- Full Text
- View/download PDF