×

Image inpainting-based behavior image secret sharing. (English) Zbl 1468.94028

Summary: The polynomial-based image secret sharing (ISS) scheme encodes a secret image into \(n\) shadows assigned to \(n\) participants. The secret image with high resolution is decoded by Lagrange interpolation when collecting any \(k\) or more shadows. Thus, ISS is used in applications such as distributive storage in the cloud, digital watermarking, block chain, and access control. Meaningful shadows are significant in ISS because meaningful shadows decrease the suspicion of image encryption and increase the efficiency of shadow management. Generally, previously meaningful ISS schemes were achieved through embedding the shadows into cover images using information hiding techniques and suffer from large pixel expansion and complex decoding procedure. Digital image processing, such as inpainting (texture synthesis), is a standard technique in multimedia applications. It will be highly significant if ISS can be performed in the processing of a normal digital image processing technique. Generally, the encoding method of an ISS scheme entails the use of a mathematical function that is sensitive to any slight change in the ISS output; therefore, the development of a method for performing the ISS procedure and simultaneously achieving image processing behavior is a key challenge. In this paper, we exploit the behavior ISS (BISS) and realize an image inpainting-based BISS scheme for the \((k, n)\) threshold. Using screening operations, a secret image is encoded into the pixels of cover images by polynomial-based ISS in the processing of inpainting shadows to obtain meaningful shadows similar to the input cover images. In addition, the secret image can be losslessly decoded by Lagrange interpolation when collecting any \(k\) or more shadows. Experiments are given to confirm the efficiency of the scheme.

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
94A60 Cryptography

References:

[1] X. Yan, Y. Lu, L. Liu, S. Wan, W. Ding, H. Liu, Exploiting the homomorphic property of visual cryptography, Int. J. Digital Crime Forensics, 9 (2017), 45-56.
[2] A. Belazi, A. A. A. El-Latif, A simple yet efficient s-box method based on chaotic sine map, Optik, 130 (2017), 1438-1444.
[3] Y. Cheng, Z. Fu, B. Yu, Improved visual secret sharing scheme for qr code applications, IEEETrans. Inf. Forensics Secur., 13 (2018), 2393-2403.
[4] G. Wang, F. Liu, W. Q. Yan, Basic visual cryptography using braille, Int. J. Digital CrimeForensics, 8 (2016), 85-93.
[5] M. Naor, A. Shamir, Visual cryptography, Workshop on the Theory and Application of of Cryptographic Techniques, Springer, Springer, Perugia, Italy, 1995, 1-12. · Zbl 0878.94048
[6] A. Shamir, How to share a secret, Commun. ACM, 22 (1979), 612-613. · Zbl 0414.94021
[7] X. Yan, L. Liu, Y. Lu, Q. Gong, Security analysis and classification of image secret sharing, J.Inf. Secur. Appl., 47 (2019), 208-216,
[8] X. Yan, J. Li, Y. Lu, L. Liu, G. Yang, H. Chen, Relations between secret sharing and secretimage sharing, Security with Intelligent Computing and Big-data Services Springer International Publishing, Cham, 2020, 79-93.
[9] W. Ding, K. Liu, X. Yan, H. Wang, L. Liu, Q. Gong, An image secret sharing method based on matrix theory, Symmetry, 10 (2018), 530.
[10] Z. Zhou, G. R. Arce, G. Di Crescenzo, Halftone visual cryptography, IEEE Trans. Image Process., 15 (2006), 2441-2453.
[11] Z. Wang, G. R. Arce, G. Di Crescenzo, Halftone visual cryptography via error diffusion, IEEETrans. Inf. Forensics Secur., 4 (2009), 383-396. · Zbl 1398.94094
[12] F. Liu, C. Wu, Embedded extended visual cryptography schemes, IEEE Trans. Inf. ForensicsSecur., 6 (2011), 307-322.
[13] J. Weir, W. Yan, A comprehensive study of visual cryptography, Transactions on Data Hiding and Multimedia Security V, Springer, Berlin, Heidelberg, 2010, 70-105.
[14] X. Yan, Y. Lu, L. Liu, General meaningful shadow construction in secret image sharing, IEEEAccess, 6 (2018), 45246-45255.
[15] T. Guo, J. Jiao, F. Liu, W. Wang, On the pixel expansion of visual cryptography scheme, Int. J.Digital Crime Forensics, 9 (2017), 38-44.
[16] X. Yan, X. Liu, C. N. Yang, An enhanced threshold visual secret sharing based on random grids, J. Real-Time Image Process., 14 (2018), 61-73.
[17] X. Yan, S. Wang, X. Niu, C. N. Yang, Halftone visual cryptography with minimum auxiliary black pixels and uniform image quality, Digital Signal Process., 38 (2015), 53-65.
[18] C. C. Thien, J. C. Lin, Secret image sharing, Comput. Graphics, 26 (2002), 765-770.
[19] C. N. Yang, C. B. Ciou, Image secret sharing method with
[20] L. Bao, S. Yi, Y. Zhou, Combination of sharing matrix and image encryption for lossless (k, n)-secret image sharing, IEEE Trans. Image Process., 26 (2017), 5618-5631. · Zbl 1409.94027
[21] Y. Liu, C. Yang, Y. Wang, L. Zhu, W. Ji, Cheating identifiable secret sharing scheme using symmetric bivariate polynomial, Inf. Sci., 453 (2018), 21-29. · Zbl 1440.94098
[22] P. Li, P. J. Ma, X. H. Su and C. N. Yang, Improvements of a two-in-one image secret sharing scheme based on gray mixing model, J. Visual Communi. Image Representation, 23 (2012), 441-453.
[23] P. Li, C. N. Yang, Q. Kong, A novel two-in-one image secret sharing scheme based on perfect black visual cryptography, J. Real-Time Image Process., 14 (2018), 41-50.
[24] A. Criminisi, P. Perez, K. Toyama, Region filling and object removal by exemplar-based image inpainting, IEEE Trans. Image Process., 13 (2004), 1200-1212.
[25] W. Shen, X. Song, X. Niu, Hiding traces of image inpainting, Res. J. Appl. Sci. Eng. Technol., 4 (2012), 4962-4968.
[26] X. Yan, Y. Lu, L. Liu, S. Wang, Partial secret image sharing for (k,n) threshold based on image inpainting, J. Visual Commun. Image Representation, 50 (2018), 135-144,
[27] Z. Wang, A. C. Bovik, H. R. Sheikh, E. P. Simoncelli, Image quality
[28] X. Yan, Q. Gong, L. Li, G. Yang, Y. Lu, J. Liu, Secret image sharing with separate shadow authentication ability, Signal Process. Image Commun., 82 (2020), 115721.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.