Random-Grid Based Region Incrementing Visual Secret Sharing

The concept of region incrementing in visual cryptography was introduced to encrypt an image into multiple secrecy levels. But, it suffers from the pixel expansion increasing exponentially as the number of participants grows. In this paper, we propose a region incrementing visual secret sharing RIVSS scheme based on random grids. The proposed scheme is a general k, n-RIVSS scheme, in which any t k ≤ t ≤ n shares can be used to reconstruct the secret regions up to t-k + 1 levels. However, no information about the input image can be revealed by any k-1 or fewer shares. With a nice property of region incrementing, the proposed scheme benefits by sharing an image without any pixel expansion and codebook requirement. We give formal proofs and experimental results to confirm both correctness and feasibility of our scheme.

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

[2]  YangChing-Nung,et al.  $k$ Out of $n$ Region Incrementing Scheme in Visual Cryptography , 2012 .

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

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

[5]  Ran-Zan Wang,et al.  Incrementing visual cryptography using random grids , 2010 .

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

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

[8]  Shyong Jian Shyu,et al.  Efficient Construction for Region Incrementing Visual Cryptography , 2012, IEEE Transactions on Circuits and Systems for Video Technology.

[9]  Sachin Kumar,et al.  Secret Image Sharing for General Access Structures using Random Grids , 2013 .

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

[11]  Rajendra Kumar Sharma,et al.  Threshold visual secret sharing based on Boolean operations , 2014, Secur. Commun. Networks.

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

[13]  Shyong Jian Shyu.  Visual Cryptograms of Random Grids for General Access Structures , 2013, IEEE Transactions on Circuits and Systems for Video Technology.

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

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

[16]  SunWei,et al.  Random grid-based visual secret sharing for general access structures with cheat-preventing ability , 2012 .

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

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

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

[20]  Jian-Jun Wang,et al.  Region incrementing visual secret sharing scheme based on random grids , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

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

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

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

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

[25]  Ching-Nung Yang,et al.  $k$ Out of $n$ Region Incrementing Scheme in Visual Cryptography , 2012, IEEE Transactions on Circuits and Systems for Video Technology.

[26]  Rajendra Kumar Sharma,et al.  Recursive Information Hiding of Secrets by Random Grids , 2013, Cryptologia.

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

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