Visual secret sharing by random grids revisited
Pattern Recognition
A Karnaugh map {2,2} secret sharing scheme for color images
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Step construction of visual cryptography schemes
IEEE Transactions on Information Forensics and Security
Efficient multi-secret image sharing based on Boolean operations
Signal Processing
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability
Image and Vision Computing
A comprehensive study of visual cryptography
Transactions on data hiding and multimedia security V
Flexible visual cryptography scheme without distortion
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Hi-index | 0.00 |
Visual secret sharing (VSS) scheme is a perfect secure method that protects a secret image by breaking it into shadows. Unlike other secret sharing schemes, the VSS scheme can be easily decoded by the human visual sight when staking the shadows. We replace a pixel in the secret image by m sub pixels in the shadow image and the value m is called as pixel expansion. In general, most papers are dedicated to find the minimum m for a VSS scheme, i.e. a smaller shadow size. However, it seems that no one studies how to trade the shadow size for the contrast. In this paper, we take the lead in studying size-adjustable VSS schemes such that one can choose appropriate shadow size and the recovered image contrast for practical use.