Constructions and Bounds for Visual Cryptography

A visual cryptography scheme for a set P of n participants is a method to encode a secret image SI into n images in such a way that any participant in P receives one image and only qualified subsets of participants can “visually” recover the secret image, but non-qualified sets of participants have no information, in an information theoretical sense, on SI. A “visual” recover for a set X\(\subseteq \)P consists of stacking together the images associated to participants in X. The participants in a qualified set X will be able to see the secret image without any knowledge of cryptography and without performing any cryptographic computation.

[1]  Douglas R. Stinson,et al.  Decomposition constructions for secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.

[2]  Alfredo De Santis,et al.  Visual Cryptography for General Access Structures , 1996, Inf. Comput..

[3]  Alfredo De Santis,et al.  Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.

[4]  Douglas R Stinson,et al.  Some recursive constructions for perfect hash families , 1996 .

[5]  Moni Naor,et al.  Visual Cryptography , 1994, Encyclopedia of Multimedia.

[6]  Kurt Mehlhorn,et al.  On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[7]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[8]  J. Komlos,et al.  On the Size of Separating Systems and Families of Perfect Hash Functions , 1984 .

[9]  Peter Elias,et al.  Zero error capacity under list decoding , 1988, IEEE Trans. Inf. Theory.