Visual cryptography for general access structures
Information and Computation
Communications of the ACM
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics
Visual cryptography for gray-level images by dithering techniques
Pattern Recognition Letters
Cheating in Visual Cryptography
Designs, Codes and Cryptography
Visual secret sharing by random grids revisited
Pattern Recognition
Journal of Visual Communication and Image Representation
Cheating Immune Threshold Visual Secret Sharing1
The Computer Journal
Cheating Prevention in Visual Cryptography
IEEE Transactions on Image Processing
Visual secret sharing with cheating prevention revisited
Digital Signal Processing
Hi-index | 0.00 |
Visual cryptography (VC), first presented by Naor and Shamir, is a variant of secret sharing, thus it also called visual secret sharing. It can be widely used in many applications such as encrypting large data efficiently. In the literature, the problem of cheating is under consideration in secret sharing. Recently, Horng et al. pointed out that cheating is possible in k-out-of-n VC schemes, and presented two kinds of the cheating prevention schemes for protecting honest participants. One of them is the authentication based cheating prevention scheme. In this paper, we analyze the definition of cheating prevention and propose a new authentication based cheating prevention scheme. This scheme is constructed with Naor-Shamir's VC scheme. Finally, we give the security analysis to prove that the proposed scheme is immune to cheating.