Sharing a verifiable secret image using two shadows
Pattern Recognition
A novel visual secret sharing scheme for multiple secrets without pixel expansion
Expert Systems with Applications: An International Journal
Probabilistic visual secret sharing schemes for grey-scale images and color images
Information Sciences: an International Journal
| Hi-index | 0.01 |
In 2007, Wang et al. proposed two visual secret sharing (VSS) schemes based on Boolean operations. The first one is a probabilistic (2, n) secret sharing scheme called (2, n) ProbVSS scheme for binary images. The other is a deterministic (n, n) secret sharing scheme for grayscale images. Although Wang et al.’s two schemes solve the problems of computational complexity and pixel expansion at the same time; they cannot be applied to color images. To expand core concept of Wang et al.’s (2, n) ProbVSS scheme to color images, in this paper, we combine Shamir’s scheme and Chang and Wu’s gradual search algorithm for a single bitmap BTC (GSBTC) to design a new (2, n) ProbVSS scheme for color images. Experimental results confirm that our proposed scheme not only generates reconstructed color images with high quality, reduces successfully shadow size but also gives random-like grayscale images as shadows for color images.