Measure-independent characterization of contrast optimal visual cryptography schemes

Visual cryptography has been studied in two models and visual cryptography schemes have been evaluated using different contrast measures. Naor and Shamir introduced the deterministic model while Kafri and Keren introduced the random grid model. In the deterministic model, three different measures of contrast have been proposed, @c"n"s, @c"v"v and @c"e"s, although only @c"n"s, has been thoroughly studied. Tight bounds on @c"n"s are known for several classes of schemes. In the random grid model the contrast is @c"r"g. In this paper we focus the attention on the deterministic model and follow a measure-independent approach, which, by using the structural properties of the schemes, enables us to provide a characterization of optimal schemes that is independent of the specific measure used to assess the contrast. In particular we characterize and provide constructions of optimal schemes for the cases of (2, n)-threshold and (n, n)-threshold schemes. Then, we apply the measure-independent results to the three measures @c"n"s, @c"v"v and @c"e"s, that have been used in the literature obtaining both new characterizations and constructions of optimal schemes as well as alternative proofs of known results. Finally we provide a connection between the deterministic and the random grid models showing that @c"e"s is the equivalent of @c"r"g. This opens up a door between the two models which have been so far treated separately.

[1]  Shyong Jian Shyu,et al.  Image encryption by random grids , 2007, Pattern Recognit..

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

[3]  Sian-Jheng Lin,et al.  Optimal (2, n) and (2, infinity) visual secret sharing by generalized random grids , 2012, J. Vis. Commun. Image Represent..

[4]  Ying-Yu Chen,et al.  Quality-adaptive visual secret sharing by random grids , 2013, J. Syst. Softw..

[5]  Paolo D'Arco,et al.  Secure Two-Party Computation: A Visual Way , 2013, ICITS.

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

[7]  Douglas R. Stinson,et al.  Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels , 2002, Des. Codes Cryptogr..

[8]  Alfredo De Santis,et al.  Contrast Optimal Threshold Visual Cryptography Schemes , 2003, SIAM J. Discret. Math..

[9]  Ching-Nung Yang,et al.  Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion , 2005, Pattern Recognit. Lett..

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

[11]  Alfredo De Santis,et al.  On the Contrast in Visual Cryptography Schemes , 1999, Journal of Cryptology.

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

[13]  Ching-Nung Yang,et al.  Size-Adjustable Visual Secret Sharing Schemes , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[14]  Hirosuke Yamamoto,et al.  Proposal of a lattice-based visual secret sharing scheme for color and gray-scale images , 1998 .

[15]  Xuehu Yan,et al.  Corrigendum to "T. Chen, K. Tsao, Threshold visual secret sharing by random grids" [J. Syst. Softw. 84(2011) 1197-1208] , 2013, J. Syst. Softw..

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

[17]  Hans Ulrich Simon,et al.  Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography , 2003, Comb. Probab. Comput..

[18]  Annalisa De Bonis,et al.  Improved Schemes for Visual Cryptography , 2001, Des. Codes Cryptogr..

[19]  Alfredo De Santis,et al.  Visual cryptography schemes with perfect reconstruction of black pixels , 1998, Comput. Graph..

[20]  Ching-Nung Yang,et al.  New Colored Visual Secret Sharing Schemes , 2000, Des. Codes Cryptogr..

[21]  Tzung-Her Chen,et al.  Visual secret sharing by random grids revisited , 2009, Pattern Recognit..

[22]  Alfredo De Santis,et al.  Using Colors to Improve Visual Cryptography for Black and White Images , 2011, ICITS.

[23]  Ching-Nung Yang,et al.  New visual secret sharing schemes using probabilistic method , 2004, Pattern Recognit. Lett..

[24]  Feng Liu,et al.  A new definition of the contrast of visual cryptography scheme , 2010, Inf. Process. Lett..

[25]  Hans Ulrich Simon.  Perfect Reconstruction of Black Pixels Revisited , 2005, FCT.

[26]  Stelvio Cimato,et al.  Visual cryptography schemes with optimal pixel expansion , 2006, Theor. Comput. Sci..

[27]  Somnath Sikdar,et al.  A New (2, n)-Visual Threshold Scheme for Color Images , 2003, INDOCRYPT.

[28]  Shyong Jian Shyu.  Image encryption by multiple random grids , 2009, Pattern Recognit..

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

[30]  Hans Ulrich Simon,et al.  Construction of visual secret sharing schemes with almost optimal contrast , 2000, SODA '00.

[31]  Xiaotian Wu,et al.  Random grid-based visual secret sharing for general access structures with cheat-preventing ability , 2012, J. Syst. Softw..

[32]  Alfredo De Santis,et al.  Color visual cryptography schemes for black and white secret images , 2013, Theor. Comput. Sci..

[33]  Stelvio Cimato,et al.  Probabilistic Visual Cryptography Schemes , 2006, Comput. J..

[34]  Tzung-Her Chen,et al.  Threshold visual secret sharing by random grids , 2011, J. Syst. Softw..

[35]  Ran-Zan Wang,et al.  Incrementing visual cryptography using random grids , 2010 .

[36]  Stelvio Cimato,et al.  Colored visual cryptography without color darkening , 2004, Theor. Comput. Sci..

[37]  Young-Chang Hou,et al.  Visual cryptography for color images , 2003, Pattern Recognit..

[38]  E. Keren,et al.  Encryption of pictures and shapes by random grids. , 1987, Optics letters.

[39]  Alfredo De Santis,et al.  On the Relation of Random Grid and Deterministic Visual Cryptography , 2014, IEEE Trans. Inf. Forensics Secur..

[40]  Stelvio Cimato,et al.  Optimal Colored Threshold Visual Cryptography Schemes , 2005, Des. Codes Cryptogr..

[41]  Rafail Ostrovsky,et al.  Visual cryptography on graphs , 2008, J. Comb. Optim..