Visual cryptography for grey level images
Information Processing Letters
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
Cheating in Visual Cryptography
Designs, Codes and Cryptography
Probabilistic Visual Cryptography Schemes
The Computer Journal
Efficient visual secret sharing scheme for color images
Pattern Recognition
Two secret sharing schemes based on Boolean operations
Pattern Recognition
A multiple-level visual secret-sharing scheme without image size expansion
Information Sciences: an International Journal
A lossless data hiding scheme based on three-pixel block differences
Pattern Recognition
Adaptive lossless steganographic scheme with centralized difference expansion
Pattern Recognition
Halftone image resampling by interpolation and error-diffusion
Proceedings of the 2nd international conference on Ubiquitous information management and communication
A Probabilistic Visual Secret Sharing Scheme for Grayscale Images with Voting Strategy
ISECS '08 Proceedings of the 2008 International Symposium on Electronic Commerce and Security
A new image secret sharing scheme to identify cheaters
Computer Standards & Interfaces
Cheating immune (2, n)-threshold visual secret sharing
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
A Novel Difference Expansion Transform for Reversible Data Embedding
IEEE Transactions on Information Forensics and Security
Inverse halftoning algorithm using edge-based lookup table approach
IEEE Transactions on Image Processing
Visual secret sharing with cheating prevention revisited
Digital Signal Processing
Hi-index | 0.00 |
In this paper, we propose a novel scheme called a self-verifying visual secret sharing scheme, which can be applied to both grayscale and color images. This scheme uses two halftone images. The first, considered to be the host image, is created by directly applying a halftoning technique to the original secret image. The other, regarded as the logo, is generated from the host image by exploiting the interpolation and error diffusion techniques. Because the set of shadows and the reconstructed secret image are generated by simple Boolean operations, no computational complexity and no pixel expansion occur in our scheme. Experimental results confirm that each shadow generated by our scheme is a noise-like image and eight times smaller than the secret image. Moreover, the peak signal-to-noise ratio value of the reconstructed secret image is larger than 33 dB. Based on the extracted halftone logo, the proposed scheme provides an effective solution for verifying the reliability of the set of collected shadows as well as the reconstructed secret image. Furthermore, the reconstructed secret image can be established completely if and only if K out of n valid shadows have been collected. To achieve our objectives, four techniques were adopted: error diffusion, image clustering, interpolation, and inverse halftoning-based edge detection.