On the Contrast in Visual Cryptography Schemes

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.

[1]  Alfredo De Santis,et al.  Extended capabilities for visual cryptography , 2001, Theor. Comput. Sci..

[2]  Eric R. Verheul,et al.  Constructions and Properties of k out of n Visual Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

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

[4]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[5]  C. Colbourn,et al.  CRC Handbook of Combinatorial Designs , 1996 .

[6]  Hans Ulrich Simon,et al.  Contrast-optimal k out of n secret sharing schemes in visual cryptography , 2000, Theor. Comput. Sci..

[7]  Moni Naor,et al.  Visual Authentication and Identification , 1997, CRYPTO.

[8]  Stefan Droste,et al.  New Results on Visual Cryptography , 1996, CRYPTO.

[9]  Moni Naor,et al.  Visual Cryptography II: Improving the Contrast Via the Cover Base , 1996, Security Protocols Workshop.

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

[11]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[12]  Mihai Caragiu.  On a Class of Constant Weight Codes , 1996, Electron. J. Comb..

[13]  Hanfried Lenz,et al.  Design theory , 1985 .

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

[15]  Alfredo De Santis,et al.  Extended Schemes for Visual Cryptography , 1995 .

[16]  Hans Ulrich Simon,et al.  Contrast-optimal k out of n secret sharing schemes in visual cryptography , 1997, Theor. Comput. Sci..

[17]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .