Threshold visual secret sharing based on Boolean operations

We design a new k,n-threshold visual secret sharing scheme on the basis of Boolean operations. We propose two different algorithms to encrypt a secret image into n meaningless shares such that no secret information can be obtained by having any k-1 or fewer shares. However, the secret image can be reconstructed easily by XOR of any ki¾?n or more shares. Both the algorithms have used simple Boolean operations such as OR and XOR. The proposed scheme broadens the potential applicability of Boolean operation-based visual secret sharing by generating the shares of size same as that of the original secret image. Formal proofs, security analysis, and the experimental results are given to demonstrate the correctness and feasibility of the proposed scheme. Copyright © 2013 John Wiley & Sons, Ltd.

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

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

[3]  Ja-Chen Lin,et al.  An image-sharing method with user-friendly shadow images , 2003, IEEE Trans. Circuits Syst. Video Technol..

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

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

[6]  Sachin Kumar,et al.  Improving Contrast in Random Grids Based Visual Secret Sharing , 2012 .

[7]  Chin-Chen Chang,et al.  A Probabilistic Visual Secret Sharing Scheme for Grayscale Images with Voting Strategy , 2008, 2008 International Symposium on Electronic Commerce and Security.

[8]  Ja-Chen Lin,et al.  Sharing and hiding secret images with size constraint , 2004, Pattern Recognit..

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

[10]  Tzungher Chen,et al.  Efficient multi-secret image sharing based on Boolean operations , 2011, Signal Process..

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

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

[13]  Xiaobo Li,et al.  Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images , 2007, Inscrypt.

[14]  Daniel L. Lau,et al.  Modern Digital Halftoning , 2001 .

[15]  Ran-Zan Wang,et al.  Secret image sharing with smaller shadow images , 2006, Pattern Recognit. Lett..

[16]  Ja-Chen Lin,et al.  Secret Image Sharing: a Boolean-Operations-Based Approach Combining Benefits of Polynomial-Based and Fast Approaches , 2009, Int. J. Pattern Recognit. Artif. Intell..

[17]  E. Todeva.  Networks , 2007 .

[18]  Ja-Chen Lin,et al.  Secret image sharing , 2002, Comput. Graph..

[19]  Robert Ulichney,et al.  Digital Halftoning , 1987 .

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

[21]  Wei Sun,et al.  Visual secret sharing for general access structures by random grids , 2012, IET Inf. Secur..

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

[23]  Ning Ma,et al.  Two secret sharing schemes based on Boolean operations , 2007, Pattern Recognit..

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

[25]  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..

[26]  Robert Ulichney.  Review of halftoning techniques , 1999, Electronic Imaging.

[27]  M. Ulutas,et al.  A PVSS Scheme Based on Boolean Operations with Improved Contrast , 2009, 2009 International Conference on Network and Service Security.

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