Visual secret sharing with meaningful shares

A conventional k out of n visual cryptographic scheme ((k, n)-VCS) encodes one secret image P into n random-looking transparencies (called shares) such that any group of k or more transparencies reveals P to our eyes when they are superimposed, while that of less than k ones cannot. Given one secret image P and one cover image C, we study (k, n)-VCS with meaningful shares in this paper where shares could be recognized as the meaningful C (instead of random pictures) and their superimpositions follow the requirements of (k, n)-VCS. We present a formal definition and develop an efficient construction for (k, n)-VCS with meaningful shares. Experimental results demonstrate the effectiveness of our construction.

[1]  Shyong Jian Shyu,et al.  General Constructions for Threshold Multiple-Secret Visual Cryptographic Schemes , 2013, IEEE Transactions on Information Forensics and Security.

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

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

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

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

[6]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

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

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

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

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

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

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

[13]  Shyong Jian Shyu,et al.  Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes , 2011, IEEE Trans. Inf. Forensics Secur..

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