Analysis of Secret Share Design for Color Image using Visual Cryptography Scheme and Halftone

Visual cryptography encodes a secret binary image (SI) into shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the N shares, however, have no visual meaning and hinder the objectives of visual cryptography. Visual cryptography (VC) is a secret sharing scheme of decomposing a secret image into n transparencies, and the stacking of any t out of n transparencies reveals the secret content. The perfect security condition of VC scheme requires the strict requirement where any t-1 or fewer transparencies cannot extract any information about the secret. A HVC construction method is proposed that can encode a secret halftone image into color halftone shares. The secret image is concurrently embedded into color halftone shares. In the present work CMY color model will be implemented with ((n-1), n) secret sharing scheme based on visual cryptography for the color image and compared and proved to be better that the black and white model and the RGB color model which is free from the issue of security, pixel expansion and accuracy issue as well. As the printer use the Cyan, Magenta, Yellow and Black color for printing that’s why CMY color model is implemented in this work to prove that CMY color space is better than RGB color space.

[1]  Josef Pieprzyk,et al.  Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology , 2008 .

[2]  Hans Ulrich Simon,et al.  Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography , 2000, Combinatorics, Probability and Computing.

[3]  R. Ito,et al.  Image Size Invariant Visual Cryptography , 1999 .

[4]  Wen-Guey Tzeng,et al.  Cheating Prevention in Visual Cryptography , 2007, IEEE Transactions on Image Processing.

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

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

[7]  Zhi Zhou,et al.  Halftone visual cryptography , 2006, IEEE Transactions on Image Processing.

[8]  Gwoboa Horng,et al.  Cheating in Visual Cryptography , 2006, Des. Codes Cryptogr..

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

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

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

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

[13]  Ran-Zan Wang,et al.  Region Incrementing Visual Cryptography , 2009, IEEE Signal Processing Letters.

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

[15]  Feng Liu,et al.  Colour visual cryptography schemes , 2008, IET Inf. Secur..

[16]  Feng Liu,et al.  Step Construction of Visual Cryptography Schemes , 2010, IEEE Transactions on Information Forensics and Security.

[17]  Ja-Chen Lin,et al.  Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expansion , 2010, J. Vis. Commun. Image Represent..

[18]  Giovanni Di Crescenzo,et al.  Halftone Visual Cryptography Via Error Diffusion , 2009, IEEE Transactions on Information Forensics and Security.