New privilege-based visual cryptography with arbitrary privilege levels

Abstract Recently, Hou et al. introduced a novel (2, n) privilege-based visual cryptography scheme (PVCS) with various privilege levels of shadow images. In this scheme, a shadow with a higher privilege contributes more recovered information, while a lower privileged shadow has the less recovery capability. Moreover, the visual quality of stacked result depends on the total sum of privilege levels for all involved shadows in reconstruction. Unfortunately, the PVC scheme has the inconsistency of the contrast of recovered image and the sum of privilege levels. Accordingly, an enhanced Hou et al.’s (2, n)-PVC scheme (EPVCS) is proposed to solve this inconsistency problem. However, the EPVCS is not a general solution to implement all PVCSs with arbitrary privilege levels, and it also has the unequal whiteness of shadows. In this paper, we first extend Hou et al.’s (2, n)-EPVCS with a correct privilege levels achieving the consistency of the contrast and the sum of privilege levels. Then we construct a (2, n)-PVCS to allow arbitrary privilege levels and provide the equal whiteness for each shadow.

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

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

[3]  Chih-Fong Tsai,et al.  Block-based progressive visual secret sharing , 2013, Inf. Sci..

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

[5]  Xiaobo Li,et al.  Probabilistic visual secret sharing schemes for grey-scale images and color images , 2007, Inf. Sci..

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

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

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

[9]  Ching-Nung Yang,et al.  Constructions and Properties of General ( k, n ) Block-Based Progressive Visual Cryptography , 2015 .

[10]  Ching-Nung Yang,et al.  A discussion on the relationship between probabilistic visual cryptography and random grid , 2014, Inf. Sci..

[11]  Ching-Nung Yang,et al.  Essential Visual Cryptographic Scheme with Different Importance of Shares , 2014, ICONIP.

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

[13]  Chih-Fong Tsai,et al.  A privilege-based visual secret sharing model , 2015, J. Vis. Commun. Image Represent..

[14]  Douglas R. Stinson,et al.  Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels , 2002, Des. Codes Cryptogr..

[15]  Shyong Jian Shyu,et al.  General Constructions for Threshold Multiple-Secret Visual Cryptographic Schemes , 2013, IEEE Transactions on Information Forensics and Security.

[16]  Ching-Nung Yang,et al.  Almost-aspect-ratio-invariant visual cryptography without adding extra subpixels , 2015, Inf. Sci..

[17]  Feng Liu,et al.  Cheating immune visual cryptography scheme , 2011, IET Inf. Secur..

[18]  Eric R. Verheul,et al.  Constructions and Properties of k out of n Visual Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

[19]  Ching-Nung Yang,et al.  Property Analysis of XOR-Based Visual Cryptography , 2014, IEEE Transactions on Circuits and Systems for Video Technology.

[20]  Stelvio Cimato,et al.  Ideal contrast visual cryptography schemes with reversing , 2005, Inf. Process. Lett..