Pattern Recognition Letters
Visual Authentication and Identification
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Sharing multiple secrets in digital images
Journal of Systems and Software
Sharing a Secret Two-Tone Image in Two Gray-Level Images
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Cheating in Visual Cryptography
Designs, Codes and Cryptography
Image encryption by random grids
Pattern Recognition
A Novel Subliminal Channel Found in Visual Cryptography and Its Application to Image Hiding
IIH-MSP '07 Proceedings of the Third International Conference on International Information Hiding and Multimedia Signal Processing (IIH-MSP 2007) - Volume 01
Cheating Prevention in Visual Cryptography
IEEE Transactions on Image Processing
Multi-level visual secret sharing scheme with smooth-looking
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
A novel user-participating authentication scheme
Journal of Systems and Software
Random grid-based visual secret sharing for general access structures with cheat-preventing ability
Journal of Systems and Software
Authenticating visual cryptography shares using 2d barcodes
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Hi-index | 0.00 |
Visual Cryptography (VC) has drawn much attention for providing the service of secret communication. Basically, VC is the process of encoding a secret into several meaningless shares and later decoding the secret by superimposing all or some of the shares without any computation involved. VC has been adopted to support some practical applications, such as image authentication, visual authentication, image hiding, and digital watermarking. Unfortunately, in many applications, VC has been shown to suffer from the "cheating problem" in which the disclosed secret image may be altered by malicious insiders who are called "cheaters." While ubiquitous computing has been well developed, it has recently occurred to people in both academia and industry that research could benefit more from computational VC by introducing light-weight computation costs in the decoding phase. In this paper, a simple scheme is proposed to conquer the cheating problem by facilitating the capability of share authentication. It is worthwhile to note that the proposed scheme can identify for certain whether cheating attacks have occurred or not, while other schemes that have the same objective frequently provide a vague answer. In addition, the proposed scheme effectively addresses the two main problems of VC, i.e., the inconvenience of meaningless share management and the challenge of achieving difficult alignment.