Visual cryptography for general access structures
Information and Computation
Extended capabilities for visual cryptography
Theoretical Computer Science
Modern Digital Halftoning
Cheating in Visual Cryptography
Designs, Codes and Cryptography
Optimal (2, n) visual cryptographic schemes
Designs, Codes and Cryptography
Image encryption by random grids
Pattern Recognition
The alignment problem of visual cryptography schemes
Designs, Codes and Cryptography
Image encryption by multiple random grids
Pattern Recognition
Wireless Security and Cryptography: Specifications and Implementations
Wireless Security and Cryptography: Specifications and Implementations
Visual secret sharing by random grids revisited
Pattern Recognition
Optimal (k, n) visual cryptographic schemes for general k
Designs, Codes and Cryptography
Threshold visual secret sharing by random grids
Journal of Systems and Software
Improving the visual quality of size invariant visual cryptography scheme
Journal of Visual Communication and Image Representation
Random grid-based visual secret sharing for general access structures with cheat-preventing ability
Journal of Systems and Software
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Cheating Prevention in Visual Cryptography
IEEE Transactions on Image Processing
Towards Shift Tolerant Visual Secret Sharing Schemes
IEEE Transactions on Information Forensics and Security
Multi-pixel encryption visual cryptography
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Improved tagged visual cryptography by random grids
Signal Processing
| Hi-index | 0.00 |
A (k, n) visual cryptographic scheme (VCS) is a secret sharing method, which encodes a secret image S into n share images in such a way that the stacking of any more than or equal to k share images will reveal S, while any less than k share images provide no information about S. Kafri and Keren (1987) firstly implements (2,2)-VCS by random grids (RG-based VCS). Compared to conventional solutions of VCS, RG-based VCSs need neither extra pixel expansion nor complex codebook design. However, for a long period, RG-based VCSs are confined to (2,2) access structure. Until recently, Chen and Tsao (2011) proposed the first (k, n) RG-based VCS. In this paper, we improve the contrast of Chen and Tsao (2011)'s threshold scheme. The experimental results show that the proposed scheme outperforms Chen and Tsao (2011)'s scheme significantly in visual quality.