Digital image processing (2nd ed.)
Digital image processing (2nd ed.)
Visual cryptography for general access structures
Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Concrete Math
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics
Constructions and Bounds for Visual Cryptography
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels
Designs, Codes and Cryptography
A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Randomness in secret sharing and visual cryptography schemes
Theoretical Computer Science
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters
Optimal colored threshold visual cryptography schemes
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Efficient visual secret sharing scheme for color images
Pattern Recognition
Colored visual cryptography without color darkening
Theoretical Computer Science
Two secret sharing schemes based on Boolean operations
Pattern Recognition
Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images
Information Security and Cryptology
Image encryption by multiple random grids
Pattern Recognition
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images
Information Security and Cryptology --- ICISC 2008
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters
A new definition of the contrast of visual cryptography scheme
Information Processing Letters
A comprehensive study of visual cryptography
Transactions on data hiding and multimedia security V
On converting secret sharing scheme to visual secret sharing scheme
EURASIP Journal on Advances in Signal Processing - Special issue on advanced image processing for defense and security applications
Using colors to improve visual cryptography for black and white images
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
A general method for construction of (t, n)-threshold visual secret sharing schemes for color images
Designs, Codes and Cryptography
Improving the visual quality of size invariant visual cryptography scheme
Journal of Visual Communication and Image Representation
Colored visual cryptography without color darkening
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Perfect reconstruction of black pixels revisited
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A secret enriched visual cryptography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Color visual cryptography schemes for black and white secret images
Theoretical Computer Science
On (k, n)*-visual cryptography scheme
Designs, Codes and Cryptography
Hi-index | 0.00 |
A (k,n)-threshold visual cryptography scheme ((k,n)-threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the “visual” recovery of the secret image, but by inspecting less than k shares one cannot gain any information on the secret image. The “visual” recovery consists of xeroxing the shares onto transparencies, and then stacking them. Any k shares will reveal the secret image without any cryptographic computation.In this paper we analyze visual cryptography schemes in which the reconstruction of black pixels is perfect, that is, all the subpixels associated to a black pixel are black. For any value of k and n, where 2\leq k\leq n, we give a construction for (k,n)-threshold VCS which improves on the best previously known constructions with respect to the pixel expansion (i.e., the number of subpixels each pixel of the original image is encoded into). We also provide a construction for coloured (2,n)-threshold VCS and for coloured (n,n)-threshold VCS. Both constructions improve on the best previously known constructions with respect to the pixel expansion.