A Novel XOR-based Visual Secret Sharing Scheme with Random Grid
Ram Sekher Pati, Amitava Nag
Abstract
Ram Sekher Pati, Amitava Nag
Abstract
The basic concept of secret image sharing is to encrypt a secret image into a number of meaningless share images. Except for all the images, no information should leak out from any of the share images. The original secret image is printed onto transparencies, and stacking these transparencies directly reveals the original image. The advantage lies in the fact that no computational cost is encountered, and only the human visual system is required to decode the secret image. The visual secret sharing scheme is to encrypt a secret image into a set of share images to increase the encryption capacity. However, the schemes available use a codebook, and used pixel expansion to encrypt secret images into share images. In general, pixel expansion of twice the original order is seen. It is neither practical nor the best solution when secret images are more in number. This paper proposes a novel visual secret sharing scheme that can share a binary secret image on two share images with no codebook requirement. The experimental result reveals that the proposed approach has high contrast and also has an excellent recovery quality of the secret image. The recovered secret image type is lossless.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The basic concept of secret image sharing is to encrypt a secret image into a number of meaningless share images. Except for all the images, no information should leak out from any of the share images. The original secret image is printed onto transparencies, and stacking these transparencies directly reveals the original image. The advantage lies in the fact that no computational cost is encountered, and only the human visual system is required to decode the secret image. The visual secret sharing scheme is to encrypt a secret image into a set of share images to increase the encryption capacity. However, the schemes available use a codebook, and used pixel expansion to encrypt secret images into share images. In general, pixel expansion of twice the original order is seen. It is neither practical nor the best solution when secret images are more in number. This paper proposes a novel visual secret sharing scheme that can share a binary secret image on two share images with no codebook requirement. The experimental result reveals that the proposed approach has high contrast and also has an excellent recovery quality of the secret image. The recovered secret image type is lossless.
Key concepts: Computer science, Scheme (mathematics), Secret sharing, Grid, Theoretical computer science, Algorithm, Cryptography, Mathematics