A visual cryptography scheme for a set P ofnparticipants is a method of encoding a secret imageSIintonshadow images called shares, where each participant in P receives one share. Certain qualified subsets of participants can “visually” recover the secret image, but other, forbidden, sets of participants have no information (in an information-theoretic sense) onSI. A “visual” recovery for a setX?P consists of xeroxing the shares given to the participants inXonto transparencies, and then stacking them. The participants in a qualified setXwill be able to see the secret image without any knowledge of cryptography and without performing any cryptographic computation. In this paper we propose two techniques for constructing visual cryptography schemes for general access structures. We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed to the participants in the scheme. We provide a novel technique for realizingkout ofnthreshold visual cryptography schemes. Our construction forkout ofnvisual cryptography schemes is better with respect to pixel expansion than the one proposed by M. Naor and A. Shamir (Visual cryptography,in“Advances in Cryptology?Eurocrypt '94” CA. De Santis, Ed.), Lecture Notes in Computer Science, Vol. 950, pp. 1?12, Springer-Verlag, Berlin, 1995) and for the case of 2 out ofnis the best possible. Finally, we consider graph-based access structures, i.e., access structures in which any qualified set of participants contains at least an edge of a given graph whose vertices represent the participants of the scheme.
[1]
Douglas R Stinson,et al.
Some improved bounds on the information rate of perfect secret sharing schemes
,
1990,
Journal of Cryptology.
[2]
Moni Naor,et al.
Visual Cryptography
,
1994,
Encyclopedia of Multimedia.
[3]
Alfredo De Santis,et al.
Constructions and Bounds for Visual Cryptography
,
1996,
ICALP.
[4]
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).
[5]
J. Komlos,et al.
On the Size of Separating Systems and Families of Perfect Hash Functions
,
1984
.
[6]
Douglas R. Stinson,et al.
Decomposition constructions for secret-sharing schemes
,
1994,
IEEE Trans. Inf. Theory.
[7]
P. Erdös,et al.
Families of finite sets in which no set is covered by the union ofr others
,
1985
.
[8]
Douglas R Stinson,et al.
Some recursive constructions for perfect hash families
,
1996
.
[9]
Peter Elias,et al.
Zero error capacity under list decoding
,
1988,
IEEE Trans. Inf. Theory.
[10]
Alfredo De Santis,et al.
Extended Schemes for Visual Cryptography
,
1995
.
[11]
Richard M. Wilson,et al.
A course in combinatorics
,
1992
.