Visual Cryptography and Random Grids Schemes

Visual Cryptography (VC) and Random Grids (RG) are both visual secret sharing (VSS) techniques, which decode the secret by stacking some authorized shares. It is claimed that RG scheme benefits more than VC scheme in terms of removing the problems of pixel expansion, tailor-made codebook design, and aspect ratio change. However, we find that the encryption rules of RGS are actually the matrices sets of probabilistic VCS. The transformation from RGS to PVCS is proved and shown by means of giving theoretical analysis and conducting some specific schemes. The relationship between codebook and computational complexity are analyzed for PVCS and RGS. Furthermore, the contrast of PVCS is no less than the one of RGS under the same access structure, which is shown by experimental results.

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

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

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

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

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

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

[7]  Wen-Hsiang Tsai,et al.  Quotation Authentication: A New Approach and Efficient Solutions by Cascaded Hashing Techniques , 2010, IEEE Transactions on Information Forensics and Security.

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

[9]  Ching-Nung Yang,et al.  Colored visual cryptography scheme based on additive color mixing , 2008, Pattern Recognit..

[10]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

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

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

[13]  Chang-Chou Lin,et al.  Visual cryptography for gray-level images by dithering techniques , 2003, Pattern Recognit. Lett..

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

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

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

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

[18]  Ching-Nung Yang,et al.  Visual Cryptography Schemes with Reversing , 2008, Comput. J..

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

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

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

[22]  Alfredo De Santis,et al.  Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.

[23]  Young-Chang Hou,et al.  An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares , 2006, ISMIS.

[24]  Troels Andreasen,et al.  Foundations of Intelligent Systems , 2014, Lecture Notes in Computer Science.

[25]  Robert Parry,et al.  National Computer Conference: 4-7 May 1981 McCormick Place, Chicago, USA , 1981, Microprocess. Microsystems.