Advertisement

Multimedia Tools and Applications

, Volume 78, Issue 2, pp 2367–2384 | Cite as

Perfect recovery of XOR-based visual cryptography scheme

  • Zhengxin Fu
  • Yuqiao ChengEmail author
  • Bin Yu
Article
  • 35 Downloads

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.

Keywords

Visual cryptography XOR Operation Ideal access structure Perfect recovery General access structure Color image Multiple secret images 

Notes

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.

References

  1. 1.
    Ateniese G, Blundo C, Santis AD, Stinson DR (1996) Visual cryptography for general access structures. Inf Comput 129(2):86–106MathSciNetCrossRefGoogle Scholar
  2. 2.
    Biham E, & Itzkovitz A. (1997). Visual cryptography with polarization [EB/OL]. http://www.cs.technion.ac.il/biham/reports/visual.ps.gz
  3. 3.
    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–285CrossRefGoogle Scholar
  4. 4.
    Chen YC (2017) Fully incrementing visual cryptography from a succinct non-monotonic structure. IEEE Transactions on Information Forensics & Security 12(5):1082–1091CrossRefGoogle Scholar
  5. 5.
    Fu Z, Yu B (2014) Optimal pixel expansion of deterministic visual cryptography scheme. Multimedia Tools & Applications 73(3):1177–1193CrossRefGoogle Scholar
  6. 6.
    Liu F, Wu C, Lin X (2010) Step construction of visual cryptography schemes. IEEE Transactions on Information Forensics & Security 5(1):27–38CrossRefGoogle Scholar
  7. 7.
    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–1623Google Scholar
  8. 8.
    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–1272Google Scholar
  9. 9.
    Liu Y, Nie L, Liu L, Rosenblum DS (2016) From action to activity: sensor-based activity recognition. Neurocomputing 181:108–115CrossRefGoogle Scholar
  10. 10.
    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–207Google Scholar
  11. 11.
    Naor M, Shamir A (1995) Visual cryptography. LNCS 950:1–12MathSciNetzbMATHGoogle Scholar
  12. 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–740Google Scholar
  13. 13.
    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–1561CrossRefGoogle Scholar
  14. 14.
    Tuyls P, Hollmann HD, Lint JH, Tolhuizen L (2005) Xor-based visual cryptography schemes. Designs Codes & Cryptography 37(1):169–186MathSciNetCrossRefGoogle Scholar
  15. 15.
    Viet DQ, Kurosawa K (2004) Almost Ideal Contrast Visual Cryptography with Reversing. Topics in Cryptology – CT-RSA 2004. Springer Berlin Heidelberg, BerlinzbMATHGoogle Scholar
  16. 16.
    Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on boolean operations. Pattern Recogn 40(10):2776–2785CrossRefGoogle Scholar
  17. 17.
    Yang CN, Wang CC, Chen TS (2008) Visual Cryptography Schemes with Reversing. Oxford University Press, OxfordCrossRefGoogle Scholar
  18. 18.
    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–810CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Information Engineering UniversityZhengzhouChina

Personalised recommendations