Visual cryptography for general access structures
Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Contrast-optimal k out of n secret sharing schemes in visual cryptography
Theoretical Computer Science - computing and combinatorics
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels
Designs, Codes and Cryptography
Improved Schemes for Visual Cryptography
Designs, Codes and Cryptography
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Combinatorics, Probability and Computing
Randomness in secret sharing and visual cryptography schemes
Theoretical Computer Science
A new definition of the contrast of visual cryptography scheme
Information Processing Letters
Efficient multi-secret image sharing based on Boolean operations
Signal Processing
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability
Image and Vision Computing
A comprehensive study of visual cryptography
Transactions on data hiding and multimedia security V
Compatible ideal contrast visual cryptography schemes with reversing
ISC'05 Proceedings of the 8th international conference on Information Security
Improvements of a two-in-one image secret sharing scheme based on gray mixing model
Journal of Visual Communication and Image Representation
Real perfect contrast visual secret sharing schemes with reversing
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Sharing Numerous Images Secretly with Reduced Possessing Load
Fundamenta Informaticae
Region-in-Region incrementing visual cryptography scheme
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Aspect ratio invariant visual cryptography by image filtering and resizing
Personal and Ubiquitous Computing
Hi-index | 0.89 |
A visual cryptography scheme (VCS) for a set of n participants is a method to encode a secret image, consisting of black and white pixels, into n transparencies, one for each participant. Certain qualified subsets of participants can ''visually'' recover the secret image by stacking their transparencies, whereas, other, forbidden, subsets of participants, cannot gain any information about the secret image. Recently, Viet and Kurosawa proposed a VCS with reversing, which is a VCS where the participants are also allowed to reverse their transparencies, i.e., to change black pixels to white pixels and vice-versa. They showed how to construct VCSs with reversing where the reconstruction of black (white, respectively) pixels is perfect, whereas, the reconstruction of white (black, respectively) pixels is almost perfect. In both their schemes there is a loss of resolution, since the number of pixels in the reconstructed image is greater than that in the original secret image. In this paper we show how to construct VCSs with reversing where reconstruction of both black and white pixels is perfect. In our schemes each participant is required to store a certain number of transparencies, each having the same number of pixels as the original secret image. Moreover, our schemes guarantee no loss of resolution, since the reconstructed image is exactly the same as the original secret image. Finally, compared to the schemes of Viet and Kurosawa, our schemes require each participant to store a smaller amount of information.