Extended Schemes for Visual Cryptography

An extended visual cryptography scheme, (? Qual ; ? Forb ; m)-EVCS for short, with pixel \expansion" m, for an access structure (? Qual ; ? Forb) on a set of n participants, is a technique to encode n innocent looking images in such a way that when we stack together the transparencies associated to participants in any set X 2 ? Qual we get the secret message with no trace of the original images, but any X 2 ? Forb has no information on the shared image. Moreover, after the original innocent looking images are encoded they are still meaningful, that is, any user will recognize the image on his transparency. In this paper we rst present a general technique to implement extended visual cryptography schemes, which uses hypergraph colourings. Then we discuss some applications of this technique to various interesting classes of access structures by using relevant results from the theory of hypergraph colourings.

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

[2]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Martin Fürer Improved Hardness Results for Approximating the Chromatic Number , 1995, FOCS.

[4]  Alfredo De Santis,et al.  Constructions and Bounds for Visual Cryptography , 1996, ICALP.

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