Visual cryptography for general access structures
Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
New Colored Visual Secret Sharing Schemes
Designs, Codes and Cryptography
Extended capabilities for visual cryptography
Theoretical Computer Science
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
Optimal colored threshold visual cryptography schemes
Designs, Codes and Cryptography
A general method for construction of (t, n)-threshold visual secret sharing schemes for color images
Designs, Codes and Cryptography
Hi-index | 0.00 |
Visual cryptography schemes allow the encoding of a secret image into shares, in the form of transparencies, which are distributed to the participants. The shares are such that only qualified subsets of participants can visually recover the secret image by superimposing the transparencies. In this paper we study colored visual cryptography schemes. Most of previous work on colored visual cryptography allows the superposition of pixels having the same color assuming that the resulting pixel still has the same color. This is not what happens in reality since when superimposing two pixels of the same color one gets a darker version of that color, which effectively is a different color. Superimposing many pixels of the same color might result in a so dark version of the color that the resulting pixel might be not distinguishable from a black pixel. Thus we propose a model where the reconstruction has to guarantee that the reconstructed secret pixel has the same color of the original one and not a darker version of it. We give a construction of c-color (k,n)-threshold visual cryptography schemes. Since we have to guarantee the reconstruction of the exact original color, in many cases our schemes have a bigger pixel expansion than previous ones. However, for the case of k = n, we get a smaller pixel expansion when compared with schemes that to do not guarantee the exact reconstruction of the original color. We also prove that, in the model introduced in this paper, our schemes for k = n have optimal pixel expansion.