Communications of the ACM
Visual Authentication and Identification
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
Seeing-Is-Believing: Using Camera Phones for Human-Verifiable Authentication
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Secret image sharing with smaller shadow images
Pattern Recognition Letters
Probabilistic Visual Cryptography Schemes
The Computer Journal
Improvements of image sharing with steganography and authentication
Journal of Systems and Software
Sharing multiple secrets in visual cryptography
Pattern Recognition
Sharing secrets in stego images with authentication
Pattern Recognition
Visual secret sharing for multiple secrets
Pattern Recognition
The alignment problem of visual cryptography schemes
Designs, Codes and Cryptography
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)
Improving the visual quality of size invariant visual cryptography scheme
Journal of Visual Communication and Image Representation
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Hi-index | 0.00 |
Naor and Shamir proposed the notion of a (k,n) visual cryptography scheme (VCS), which allows k or more stacked transparent share images to reveal a secret image. It can be used without prerequisite knowledge of cryptography or complex computations. In these schemes, no information about the secret can be obtained from fewer than k shares. Previous VCSs use black and white subpixels to create share images. In this paper, we present a letter-based VCS (LVCS) where pixels are replaced by letters for the share images. Shares can now be constructed using meaningful data as subterfuge all while carrying secret data in plain sight, and an adversary will not recognize them as containing secrets. We prove that the proposed (k,n)-LVCS satisfies contrast and security conditions and secret information may be reconstructed by any k shares but with less than k shares reveal nothing.