Abstract.
A visual cryptography scheme is a method to encode a secret image SI into shadow images called shares such that certain qualified subsets of shares enable the ``visual'' recovery of the secret image. The ``visual'' recovery consists of xeroxing the shares onto transparencies, and then stacking them. The shares of a qualified set will reveal the secret image without any cryptographic computation.
In this paper we analyze the contrast of the reconstructed image in k out of n visual cryptography schemes. (In such a scheme any k shares will reveal the image, but no set of k-1 shares gives any information about the image.) In the case of 2 out of n threshold schemes we give a complete characterization of schemes having optimal contrast and minimum pixel expansion in terms of certain balanced incomplete block designs. In the case of k out of n threshold schemes with \(k\geq 3\) we obtain upper and lower bounds on the optimal contrast.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 27 September 1996 and revised 13 February 1998
Rights and permissions
About this article
Cite this article
Blundo, C., De Santis, A. & Stinson, D. On the Contrast in Visual Cryptography Schemes . J. Cryptology 12, 261–289 (1999). https://doi.org/10.1007/s001459900057
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001459900057