Random-grid based progressive visual secret sharing scheme with adaptive priority

Abstract This paper describes a random-grid-based progressive visual secret sharing scheme, wherein the priority weighting of each share can be adjusted. In this scheme, shares are recovered progressively to obtain a secret image. Therefore, with increasing number of shares that are collected, more information of the secret image is recovered, and vice versa. In addition, each user participating in the secret sharing can adjust the priority weighting of a share based on their determined level of secrecy; thus, each share generated by the proposed scheme has a different priority weighting value. During decryption, depending on the priority weightings of the stacked shares, the secret image can be recovered to different extents. Further, the priority level of these shares cannot be distinguished based on the average light transmission of the reconstructed image, thereby guaranteeing high security.

[1]  Bin-Chang Chieu,et al.  Robust copyright-protection scheme based on visual secret sharing and Bose–Chaudhuri–Hocquenghem code techniques , 2012, J. Electronic Imaging.

[2]  Chih-Hung Lin,et al.  Friendly progressive random-grid-based visual secret sharing with adaptive contrast , 2015, J. Vis. Commun. Image Represent..

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

[4]  Alfredo De Santis,et al.  Extended capabilities for visual cryptography , 2001, Theor. Comput. Sci..

[5]  Ran-Zan Wang,et al.  Sharing multiple secrets in visual cryptography , 2007, Pattern Recognit..

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

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

[8]  Young-Chang Hou,et al.  Progressive Visual Cryptography With Unexpanded Shares , 2011, IEEE Transactions on Circuits and Systems for Video Technology.

[9]  W. -P. Fang,et al.  Progressive viewing and sharing of sensitive images , 2006, Pattern Recognition and Image Analysis.

[10]  Balasubramanian Raman,et al.  A blind watermarking algorithm based on fractional Fourier transform and visual cryptography , 2012, Signal Process..

[11]  Shyong Jian Shyu,et al.  Visual cryptograms of random grids for threshold access structures , 2015, Theor. Comput. Sci..

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

[13]  Stelvio Cimato,et al.  Visual cryptography schemes with optimal pixel expansion , 2006, Theor. Comput. Sci..

[14]  Moni Naor,et al.  Visual Authentication and Identification , 1997, CRYPTO.

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

[16]  Feng Liu,et al.  Improving the visual quality of size invariant visual cryptography scheme , 2012, J. Vis. Commun. Image Represent..

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

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

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

[20]  Ching-Nung Yang,et al.  New privilege-based visual cryptography with arbitrary privilege levels , 2017, J. Vis. Commun. Image Represent..

[21]  Yvo Desmedt,et al.  Audio and Optical Cryptography , 1998, ASIACRYPT.

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