Abstract
Visual cryptography is an interesting secret sharing scheme, in which participants can observe the secret image by stacking their shares. However, the size expansion and distorted visual effect are two disadvantages of visual cryptography. In this paper, we focus on how to realize the perfect recovery by XOR-ing shares directly. First, we propose the definition of ideal access structure, which is the key point of perfect recovery of XOR-based visual cryptography scheme. The characteristics of ideal access structure are analyzed, and the construction algorithm of shares under ideal access structure is designed. Based on the ideal access structure, a new algorithm is proposed for dividing the general access structure into several ideal access structures, and the secret sharing and recovering algorithms for general access structure are presented. Furthermore, our method can also be utilized in color visual cryptography and multi-secret visual cryptography. The security and perfect recovery of our method have been proved theoretically. Compared with the previous schemes, the proposed scheme realizes the perfect recovery of secret image by XOR-ing shares directly, and the sizes of shares can be decreased efficiently compared with the previous schemes.
Similar content being viewed by others
References
Ateniese G, Blundo C, Santis AD, Stinson DR (1996) Visual cryptography for general access structures. Inf Comput 129(2):86–106
Biham E, & Itzkovitz A. (1997). Visual cryptography with polarization [EB/OL]. http://www.cs.technion.ac.il/biham/reports/visual.ps.gz
Chao K, Lin J (2009) Secret image sharing: a boolean-operations -based approach combining benefits of polynomial-based and fast approaches. Int J Pattern Recognit Artif Intell 23(02):263–285
Chen YC (2017) Fully incrementing visual cryptography from a succinct non-monotonic structure. IEEE Transactions on Information Forensics & Security 12(5):1082–1091
Fu Z, Yu B (2014) Optimal pixel expansion of deterministic visual cryptography scheme. Multimedia Tools & Applications 73(3):1177–1193
Liu F, Wu C, Lin X (2010) Step construction of visual cryptography schemes. IEEE Transactions on Information Forensics & Security 5(1):27–38
Liu Y, Nie L, Han L, Zhang L, Rosenblum DS (2016) Action2activity: recognizing complex activities from sensor data. Proceedings of the twenty-fourth international joint conference on artificial intelligence, pp 1617–1623
Liu L, Cheng L, Liu Y, Jia Y, Rosenblum DS (2016) Recognizing Complex Activities by a Probabilistic Interval-Based Model. Proceedings of the twenty-fourth international joint conference on artificial intelligence, pp. 1266–1272
Liu Y, Nie L, Liu L, Rosenblum DS (2016) From action to activity: sensor-based activity recognition. Neurocomputing 181:108–115
Liu L, Cheng L, Liu Y, Jia Y, Rosenblum DS (2016) Fortune teller: Predicting your career path. Thirtieth AAAI Conference on Artificial Intelligence, pp. 201–207
Naor M, Shamir A (1995) Visual cryptography. LNCS 950:1–12
Preoţiuc-Pietro D, Liu Y, Hopkins D, Ungar L (2017) Beyond binary labels: political ideology prediction of twitter users. Meeting of the Association for Computational Linguistics 729–740
Shyu SJ, Chen MC (2015) Minimizing pixel expansion in visual cryptographic scheme for general access structures. IEEE Transactions on Circuits & Systems for Video Technology 25(9):1557–1561
Tuyls P, Hollmann HD, Lint JH, Tolhuizen L (2005) Xor-based visual cryptography schemes. Designs Codes & Cryptography 37(1):169–186
Viet DQ, Kurosawa K (2004) Almost Ideal Contrast Visual Cryptography with Reversing. Topics in Cryptology – CT-RSA 2004. Springer Berlin Heidelberg, Berlin
Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on boolean operations. Pattern Recogn 40(10):2776–2785
Yang CN, Wang CC, Chen TS (2008) Visual Cryptography Schemes with Reversing. Oxford University Press, Oxford
Yang CN, Shih HW, Wu CC, Harn L (2012) $k$, out of $n$, region incrementing scheme in visual cryptography. IEEE Transactions on Circuits & Systems for Video Technology 22(5):799–810
Acknowledgements
The authors thank the anonymous reviewers for their valuable comments. This work was supported in part by the National Natural Science Foundation of China under Grant No.61602513 and the Outstanding Youth Foundation of Zhengzhou Information Science and Technology Institute under Grant No.2016611303.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
The division result on (k, n) threshold structure (1 < k < n < 7).
(2, 3) threshold structure:
Γ1 = {{1,2},{1,3}}; Γ2 = {{2,3}}.
(2, 4) threshold structure:
Γ1 = {{1,2},{2,3}, {1,4},{3,4}}; Γ2 = {{1,3},{2,4}}.
(2, 5) threshold structure:
Γ1 = {{1,2},{1,3},{1,4},{2,5},{3,5},{4,5}}; Γ2 = {{1,5},{2,3},{3,4}};
Γ3 = {{2,4}}.
(2, 6) threshold structure:
Γ1 = {{1,2},{1,3},{1,4},{1,5},{2,6},{3,6},{4,6},{5,6}}; Γ2 = {{2,5}, {3,4}};
Γ3 = {{1,6},{2,3},{2,4},{3,5},{4,5}}.
(3, 4) threshold structure:
Γ1 = {{1,2,3},{1,2,4}}; Γ2 = {{1,3,4},{2,3,4}}.
(3, 5) threshold structure:
Γ1 = {{1,2,3},{1,2,4},{1,2,5}}; Γ2 = {{1,3,4},{2,3,4},{1,3,5},{2,3,5}};
Γ3 = {{2,4,5},{3,4,5},{1,4,5}}.
(3, 6) threshold structure:
Γ1 = {{1,2,3},{1,2,4},{1,2,5},{1,3,6},{1,4,6},{1,5,6}};
Γ2 = {{1,3,4},{2,3,4},{3,4,5},{3,4,6}}; Γ3 = {{1,2,6},{2,4,6},{2,5,6},{2,3,6}};
Γ4 = {{1,3,5},{1,4,5},{2,3,5},{2,4,5},{4,5,6},{3,5,6}}.
(4, 6) threshold structure:
Γ1 = {{1,2,3,4},{1,2,3,5},{1,2,4,6},{1,2,5,6}}; Γ2 = {{1,2,3,6},{1,2,4,5}};
Γ3 = {{1,3,4,5},{1,3,4,6},{2,3,4,5},{2,3,4,6}}; Γ4 = {{3,4,5,6}};
Γ5 = {{1,3,5,6},{1,4,5,6},{2,3,5,6},{2,4,5,6}}.
(4, 5) threshold structure:
Γ1 = {{1,2,3,4},{1,2,3,5}}; Γ2 = {{1,2,4,5},{1,3,4,5}}; Γ3 = {{2,3,4,5}}.
(5, 6) threshold structure:
Γ1 = {{1,2,3,4,5},{1,2,3,4,6}}; Γ2 = {{1,2,3,5,6},{1,2,4,5,6}};
Γ3 = {{1,3,4,5,6},{2,3,4,5,6}}.
Rights and permissions
About this article
Cite this article
Fu, Z., Cheng, Y. & Yu, B. Perfect recovery of XOR-based visual cryptography scheme. Multimed Tools Appl 78, 2367–2384 (2019). https://doi.org/10.1007/s11042-018-6364-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-018-6364-z