Encrypting More Information in Visual Cryptography Scheme

The visual cryptography scheme (VCS) is a scheme which encodes a secret image into several shares, and only qualified sets of shares can recover the secret image visually, other sets of shares cannot get any information about the content of the secret image. From the point of view of encrypting (carrying) the secret information, the traditional VCS is not an efficient method. The amount of the information that a VCS encrypts depends on the amount of secret pixels. And because of the restrictions of the human eyes and the pixel expansion and the alignment problem of the VCS, a VCS perhaps can only be used to encrypt a small secret image. VCS requires a random number generator to guide the generation of the shares. As we will show in this paper, the random input of VCS can ba seen as a subchannel which helps carrying more secret information. We propose a general method to increase the amount of secret information that a threshold VCS can encrypt by treating the pseudo-random inputs of the VCS as a subchannel, i.e. the Encrypting More Information Visual Cryptography Scheme (EMIVCS). We also study the bandwidth of the proposed EMIVCS. The disadvantage of the proposed scheme is that, the decoding process is computer aided. However, compared with other computer aided VCS, the proposed scheme is more efficient.

[1]  Hiroki Koga.  A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme , 2002, ASIACRYPT.

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

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

[4]  P. Babu Anto,et al.  Tamperproof transmission of fingerprints using visual cryptography schemes , 2010, Biometrics Technology.

[5]  Lawrence E. Bassham,et al.  Randomness Testing of the Advanced Encryption Standard Finalist Candidates , 2000 .

[6]  Ching-Nung Yang,et al.  Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability , 2010, Image Vis. Comput..

[7]  Feng Liu,et al.  The alignment problem of visual cryptography schemes , 2009, Des. Codes Cryptogr..

[8]  Ching-Nung Yang,et al.  Embed additional private information into two-dimensional bar codes by the visual secret sharing scheme , 2006, Integr. Comput. Aided Eng..

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

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

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

[12]  WeiQi Yan,et al.  Resolution variant visual cryptography for street view of Google Maps , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[13]  Jeffrey Snyder,et al.  Visual Cryptography and Secret Image Sharing , 2012, J. Electronic Imaging.

[14]  H. Yamamoto,et al.  Visual secret sharing schemes for plural secret images , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[16]  Ja-Chen Lin,et al.  Visual cryptography with extra ability of hiding confidential data , 2006, J. Electronic Imaging.

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

[18]  Mitsugu Iwamoto,et al.  Visual Secret Sharing Schemes for Multiple Secret Images Allowing the Rotation of Shares , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[19]  Ja-Chen Lin,et al.  VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches , 2007, Pattern Recognit..

[20]  Shyong Jian Shyu,et al.  Efficient visual secret sharing scheme for color images , 2006, Pattern Recognit..