Optimal Contrast Grayscale Visual Cryptography Schemes With Reversing

被引:42
作者
Wang, Dao-Shun [1 ]
Song, Tao [1 ]
Dong, Lin [1 ]
Yang, Ching-Nung [2 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, CO, Peoples R China
[2] Natl Dong Hwa Univ, Dept Comp Sci & Informat Engn, Hualien 974, Taiwan
基金
中国国家自然科学基金;
关键词
Optimal contrast; reversing operation; visual cryptography; visual secret sharing; SECRET SHARING SCHEMES;
D O I
10.1109/TIFS.2013.2281108
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The visual cryptography scheme (VCS) is an encryption technique that utilizes the human visual system in recovering a secret image and it does not require any complex calculation. However, the contrast of the reconstructed image could be quite low. A number of reversing-based VCSs (or VCSs with reversing) (RVCS) have been proposed for binary secret images, allowing participants to perform a reversing operation on shares (or shadows). This reversing operation can be easily implemented by current copy machines. Some existing traditional VCS schemes without reversing (nRVCS) can be extended to RVCS with the same pixel expansion for binary image, and the RVCS can achieve ideal contrast, significantly higher than that of the corresponding nRVCS. In the application of grayscale VCS, the contrast is much lower than that of the binary cases. Therefore, it is more desirable to improve the contrast in the grayscale image reconstruction. However, when grayscale images are involved, one cannot take advantage of this reversing operation so easily. Many existing grayscale nRVCS cannot be directly extended to RVCS. In this paper, we first give a new grayscale nRVCS with minimum pixel expansion and propose an optimal-contrast grayscale RVCS (GRVCS) by using basis matrices of perfect black nRVCS. Also, we propose an optimal GRVCS even though the basis matrices are not perfectly black. Finally, we design an optimal-contrast GRVCS with a minimum number of shares held by each participant. The proposed schemes can satisfy different user requirements; previous RVCSs for binary images can be viewed as special cases in the schemes proposed here.
引用
收藏
页码:2059 / 2072
页数:14
相关论文
共 20 条
[1]   Visual cryptography for grey level images [J].
Blundo, C ;
De Santis, A ;
Naor, M .
INFORMATION PROCESSING LETTERS, 2000, 75 (06) :255-259
[2]   Visual cryptography schemes with perfect reconstruction of black pixels [J].
Blundo, C ;
De Santis, A .
COMPUTERS & GRAPHICS, 1998, 22 (04) :449-455
[3]   Improved schemes for visual cryptography [J].
Blundo, C ;
Bonis, AD ;
Santis, AD .
DESIGNS CODES AND CRYPTOGRAPHY, 2001, 24 (03) :255-278
[4]   A Probabilistic Visual Secret Sharing Scheme for Grayscale Images with Voting Strategy [J].
Chang, Chin-Chen ;
Lin, Chia-Chen ;
Le, T. Hoang Ngan ;
Le, Hoai Bac .
PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY, 2008, :184-+
[5]   SECRET IMAGE SHARING: A BOOLEAN-OPERATIONS-BASED APPROACH COMBINING BENEFITS OF POLYNOMIAL-BASED AND FAST APPROACHES [J].
Chao, Kun-Yuan ;
Lin, Ja-Chen .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2009, 23 (02) :263-285
[6]   Ideal contrast visual cryptography schemes with reversing [J].
Cimato, S ;
De Santis, A ;
Ferrara, AL ;
Masucci, B .
INFORMATION PROCESSING LETTERS, 2005, 93 (04) :199-206
[7]  
Haibo Zhang, 2009, Journal of Multimedia, V4, P104
[8]  
Hu CM, 2005, LECT NOTES COMPUT SC, V3650, P300
[9]  
Li-Guo Fang, 2010, Proceedings of the Third International Conference on Information and Computing Science (ICIC 2010), P195, DOI 10.1109/ICIC.2010.320
[10]  
Muecke Innes., 1999, GREYSCALE COLOUR VIS