Abstract
In this paper, a visual secret image sharing threshold scheme based on random grids and Boolean operations with the abilities of AND and XOR decryptions is proposed. When no light-weight computation device the secret could be revealed by human visual system with no cryptographic computation based on Boolean AND operation (stacking). On the other hand, if the light-weight computation device is available the secret could be revealed with better visual quality based on Boolean AND or XOR operation and could be losslessly revealed when sufficient shadow images are collected for a general k out of n scheme. Furthermore, the proposed scheme has several superior performances such as (k, n) threshold, no codebook design, avoiding the pixel expansion problem and the same color representation as digital images (digital color). Experiments are conducted to show the security and efficiency of the proposed scheme. Comparisons with previous approaches show the advantages of the proposed scheme.
Similar content being viewed by others
References
Chen TH, Tsao KH (2008) Image encryption by (n,n) random grids. In: Proceedings of 18th Information Security Conference, Hualien
Chen TH, Tsao KH (2009) Visual secret sharing by random grids revisited. Pattern Recogn 42:2203–2217
Chen T, Tsao K (2011) Threshold visual secret sharing by random grids. J Syst Softw 84:1197–1208
Dao-Shun W, Lei Z, Ning M et al (2007) Two secret sharing schemes based on Boolean operations [J]. Pattern Recogn 40(10):2776–2785
Feng YI, Daoshun W, Shundong LI, Yiqi DAI (2008) Probabilistic visual cryptography scheme with reversing. J Tsinghua Univ Sci Tech 48(1):121–123
Hou Y-C, Quan Z-Y (2011) Progressive visual cryptography with unexpanded shares. IEEE Trans Circ Sys Vi Tech 21(11):1760–1764
Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12(6):377–379
Li L, Abd El-Latif AA, Shi Z, Niu X (2012) A new loss-tolerant image encryption scheme based on secret sharing and two chaotic systems. Res J Appl Sci Eng Technol 4(8):877–883
Naor M, Shamir A (1995) Visual cryptography, in Advances in Cryptography, Eurocrypt’94, pp 1–12
Shyu SJ (2009) Image encryption by multiple random grids. Pattern Recogn 42:1582–1596
Shyu, Shyong Jian (2007) Image encryption by random grids. Pattern Recognition 40.3: 1014–1031
Tuyls P, Hollmann H, Lint J, Tolhuizen L (2005) Xor-based visual cryptography schemes. Des Codes Crypt 37:169–186
Wang Z, Arce GR (2009) Halftone visual cryptography via error diffusion. IEEE Trans Inf Forensics Secur 4(3):383–396
Weir J, WeiQi Yan Jan (2010) A comprehensive study of visual cryptography, Transactions on DHMS V, LNCS 6010, pp 70–105
Wu X, Sun W (2013) Random grid-based visual secret sharing with abilities of OR and XOR decryptions. J Vis Commun Image R 24:48–62
Xiaotian W, Sun W (2013) Improving the visual quality of random grid-based visual secret sharing. Signal Process 93(5):977–995
Yan X, Wang S, Abd El-Latif AA, Sang J, Niu X, Threshold visual secret sharing based on Boolean operations, To be appear
Yan X, Wang S, Li L, Abd AA, El-Latif ZW, Niu X (2013) A new assessment measure of shadow image quality based on error diffusion techniques. J Inf Hiding Multimedia Signal Process (JIHMSP) 4(2):118–126
Yang C (2004) New visual secret sharing schemes using probabilistic method [J]. Pattern Recogn Lett 25(4):481–494
Zhou Z, Arce GR, Crescenzo GD (2006) Halftone visual cryptography. IEEE Trans Image Process 15(8):2441–2453
Acknowledgments
The authors wish to thank the anonymous reviewers for their suggestions to improve this paper. This work is supported by the National Natural Science Foundation of China (Grant Number: 61100187, 61301099, 61361166006) and the Fundamental Research Funds for the Central Universities (Grant Number: HIT. NSRIF. 2013061).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yan, X., Wang, S., El-Latif, A.A.A. et al. Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery. Multimed Tools Appl 74, 3231–3252 (2015). https://doi.org/10.1007/s11042-013-1784-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-013-1784-2