In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant of the k out of n secret sharing problem, in which a dealer provides a transparency to each one of the n users; any k of them can see the image by stacking their transparencies, but any k−1 of them gain no information about it.
- 3.N. Alon and J. Spencer, The probabilistic method, Wiley, 1992.Google Scholar
- 5.J. Kahn, N. Linial and A. Samorodnitsky, Inclusion-exlusion: exact and approximate, manuscript.Google Scholar
- 7.F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes, North Holland, Amsterdam, 1977.Google Scholar