Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
Probabilistic Visual Cryptography Schemes
The Computer Journal
Sharing multiple secrets in visual cryptography
Pattern Recognition
Colored visual cryptography scheme based on additive color mixing
Pattern Recognition
Visual secret sharing for multiple secrets
Pattern Recognition
The alignment problem of visual cryptography schemes
Designs, Codes and Cryptography
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters
Probabilistic visual secret sharing schemes for grey-scale images and color images
Information Sciences: an International Journal
Visual Cryptography and Secret Image Sharing (Digital Imaging and Computer Vision)
Visual Cryptography and Secret Image Sharing (Digital Imaging and Computer Vision)
Hi-index | 0.00 |
Recently, some region incrementing VCSs (RIVCSs) were proposed, which can gradually reconstruct secrets in a single image. In RIVCS, the secret image is subdivided into multiple secrecy level regions, in such a way that more shadows can be used to reveal the more secrecy level regions. The incrementing region property provides an attractive feature, which enables progressive decoding. However, the secret level regions of all previous RIVCSs are disjointed, which any two secrecy level regions do not have the same overlapping areas. In this paper, we discuss a (k, n) region-in-region incrementing VCS (RiRIVCS). Our (k, n)-RiRIVCS has (n(k+1) secrecy level regions, which the next secrecy level region is in the preceding secrecy level region. Such region allocations in our RiRIVCS have more areas to hide the secret than the non-overlapping regions in the previous RIVCS.