Visual cryptography for general access structures
Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Communications of the ACM
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
New Size-Reduced Visual Secret Sharing Schemes with Half Reduction of Shadow Size
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient visual secret sharing scheme for color images
Pattern Recognition
Two secret sharing schemes based on Boolean operations
Pattern Recognition
Sharing multiple secrets in visual cryptography
Pattern Recognition
A multiple-level visual secret-sharing scheme without image size expansion
Information Sciences: an International Journal
Colored visual cryptography scheme based on additive color mixing
Pattern Recognition
Visual secret sharing for multiple secrets
Pattern Recognition
A New Probabilistic Visual Secret Sharing Scheme for Color Images
IIH-MSP '08 Proceedings of the 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Sharing visual multi-secrets using circle shares
Computer Standards & Interfaces
A novel blind detector for additive noise steganography in JPEG decompressed images
Multimedia Tools and Applications
Hi-index | 12.05 |
The main concept of the original visual secret sharing (VSS) scheme is to encrypt a secret image into n meaningless share images. It cannot leak any information of the shared secret by any combination of the n share images except for all of images. The shared secret image can be revealed by printing the share images on transparencies and stacking the transparencies directly, so that the human visual system can recognize the shared secret image without using any devices. The visual secrets sharing scheme for multiple secrets (called VSSM scheme) is intended to encrypt more than one secret image into the same quantity of share images to increase the encryption capacity compared with the original VSS scheme. However, all presented VSSM schemes utilize a pre-defined pattern book with pixel expansion to encrypt secret images into share images. In general, it leads to at least 2x times pixel expansion on the share images by any one of the VSSM schemes. Thus, the pixel expansion problem becomes more serious for sharing multiple secrets. This is neither a practical nor the best solution for increasing the number of secret sharing images. In this paper, we propose a novel VSSM scheme that can share two binary secret images on two rectangular share images with no pixel expansion. The experimental results show that the proposed approach not only has no pixel expansion, but also has an excellent recovery quality for the secret images. As our best knowledge, this is the first approach that can share multiple visual secret images without pixel expansion.