Partial secret image sharing for (k, n) threshold based on image inpainting

Shamir’s polynomial-based secret image sharing (SIS) scheme and visual secret sharing (VSS) also called visual cryptography scheme (VCS), are the primary branches in SIS. In traditional (k, n) threshold secret sharing, a secret image is fully (entirely) generated into n shadow images (shares) distributed to n associated participants. The secret image can be recovered by collecting any k or more shadow images. The previous SIS schemes dealt with the full secret image neglecting the possible situation that only part of the secret image needs protection. However, in some applications, only target part of the secret image may need to be protected while other parts may be not in a full image. In this paper, we consider the partial secret image sharing (PSIS) issue as well as propose a PSIS scheme for (n, n) threshold based on image inpainting and linear congruence (LC). First the target part is manually selected or marked in the color secret image. Second, the target part is automatically removed from the original secret image to obtain the same input cover images (unpainted shadow images). Third, the target secret part is generated into the pixels corresponding to shadow images by LC in the processing of shadow images texture synthesis (inpainting), so as to obtain the shadow images in a visually plausible way. As a result, the full secret image including the target secret part and other parts will be recovered losslessly by adding all the inpainted meaningful shadow images. Experiments are conducted to evaluate the efficiency of the proposed scheme.

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

[2]  Chuankun Wu,et al.  Embedded Extended Visual Cryptography Schemes , 2011, IEEE Transactions on Information Forensics and Security.

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

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

[6]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[7]  Yuliang Lu,et al.  Participants increasing for threshold random grids-based visual secret sharing , 2016, Journal of Real-Time Image Processing.

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

[9]  Ching-Nung Yang,et al.  Random grid-based visual secret sharing with multiple decryptions , 2015, J. Vis. Commun. Image Represent..

[10]  Ching-Nung Yang,et al.  Essential secret image sharing scheme with different importance of shadows , 2013, J. Vis. Commun. Image Represent..

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

[12]  Ching-Nung Yang,et al.  Generalized random grids-based threshold visual cryptography with meaningful shares , 2015, Signal Processing.

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

[14]  Yuliang Lu,et al.  Progressive visual secret sharing for general access structure with multiple decryptions , 2016, 2016 8th International Conference on Information Technology in Medicine and Education (ITME).

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

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

[17]  Xuehu Yan,et al.  Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery , 2013, Multimedia Tools and Applications.

[18]  Ching-Nung Yang,et al.  Halftone visual cryptography with minimum auxiliary black pixels and uniform image quality , 2015, Digit. Signal Process..

[19]  Xuehu Yan,et al.  A new meaningful secret sharing scheme based on random grids, error diffusion and chaotic encryption , 2013 .

[20]  WeiQi Yan,et al.  A Comprehensive Study of Visual Cryptography , 2010, Trans. Data Hiding Multim. Secur..

[21]  Peng Li,et al.  Improvements of a two-in-one image secret sharing scheme based on gray mixing model , 2012, J. Vis. Commun. Image Represent..

[22]  Wei Sun,et al.  Improving the visual quality of random grid-based visual secret sharing , 2013, Signal Process..

[23]  Jeng-Shyang Pan,et al.  Robust and Progressive Color Image Visual Secret Sharing Cooperated with Data Hiding , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[24]  Song Wan,et al.  A Progressive Threshold Secret Image Sharing with Meaningful Shares for Gray-Scale Image , 2016, 2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN).

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

[26]  Ching-Nung Yang,et al.  Design a new visual cryptography for human-verifiable authentication in accessing a database , 2015, Journal of Real-Time Image Processing.

[27]  Xuehu Yan,et al.  Threshold construction from specific cases in visual cryptography without the pixel expansion , 2014, Signal Process..

[28]  Patrick Pérez,et al.  Region filling and object removal by exemplar-based image inpainting , 2004, IEEE Transactions on Image Processing.

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

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

[31]  Feng Liu,et al.  Threshold visual secret sharing by random grids with improved contrast , 2013, J. Syst. Softw..

[32]  Bin Yu,et al.  Visual Cryptography and Random Grids Schemes , 2013, IWDW.