Abstract
In social networks, Secret Image Sharing (SIS) provides an effective way to protect secret images. However, most existing SIS schemes only support limited access policies, which are not flexible enough for lots of scenarios. In this work, we propose an SIS scheme to solve this defect. The core contributions of our scheme can be summarized as follows. Firstly, we propose a Secret Matrix Sharing Scheme (SMSS), which is extended from the traditional Linear Secret Sharing Scheme (LSSS). Different from LSSS, SMSS shares a secret matrix instead of a single secret value. Secondly, based on our SMSS, we propose an SIS scheme named LM-SIS, which supports monotonous access policies. Compared with other SIS schemes, our scheme has advantages in flexibility and efficiency. Furthermore, the LM-SIS scheme is compact, which is reflected in its shadow size ratio is approximately 1/k, where k denotes the root threshold of the access tree. Finally, our scheme provides lossless or approximately lossless recovery, and experimental results show that the PSNR of the recovered images is always greater than 30 dB and the SSIM usually exceeds 0.99. By sacrificing a little storage cost, our LM-SIS scheme can achieve lossless recovery.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
PyCharm is a Python Integrated Development Environment.
References
Li, L., Yuliang, L., Yan, X., Liu, L., Tan, L.: Lossless \((k, n)\)-threshold image secret sharing based on the Chinese remainder theorem without auxiliary encryption. IEEE Access 7, 75113–75121 (2019)
Yan-Xiang, H., Liu, Y.-N.: A progressively essential secret image sharing scheme using hierarchy shadow. J. Inf. Secur. Appl. 47, 371–376 (2019)
Wang, Y., Chen, J., Gong, Q., Yan, X., Sun, Y.: Weighted polynomial-based secret image sharing scheme with lossless recovery. Secur. Commun. Netw. 1–11, 2021 (2021)
Lewko, A.B., Waters, B.: Decentralizing attribute-based encryption. IACR Cryptol. ePrint Arch. 2010, 351 (2010)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
von Maltitz, M., Carle, G.: A performance and resource consumption assessment of secret sharing based secure multiparty computation. In: Garcia-Alfaro, J., Herrera-Joancomartí, J., Livraga, G., Rios, R. (eds.) DPM/CBT -2018. LNCS, vol. 11025, pp. 357–372. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00305-0_25
Yang, C.-N., Yang, Y.-Y.: On the analysis and design of visual cryptography with error correcting capability. IEEE Trans. Circuits Syst. Video Technol. 31(6), 2465–2479 (2021)
Yan, X., Yuliang, L., Yang, C.-N., Zhang, X., Wang, S.: A common method of share authentication in image secret sharing. IEEE Trans. Circuits Syst. Video Technol. 31(7), 2896–2908 (2021)
Yan, X., Liu, X., Yang, C.-N.: An enhanced threshold visual secret sharing based on random grids. J. Real-Time Image Process. 14(1), 61–73 (2015). https://doi.org/10.1007/s11554-015-0540-4
Li, J., Wang, X., Huang, Z., Wang, L., Xiang, Y.: Multi-level multi-secret sharing scheme for decentralized e-voting in cloud computing. J. Parallel Distrib. Comput. 130, 91–97 (2019)
Jia, X., Wang, D., Nie, D., Luo, X., Sun, J.Z.: A new threshold changeable secret sharing scheme based on the Chinese remainder theorem. Inf. Sci. 473, 13–30 (2019)
Beimel, A.: Secure schemes for secret sharing and key distribution. Ph.D. dissertation, Israel Institute of Technology, Technion, Haifa, Israel (1996)
Liu, Z., Cao, Z., Wong, D.S.: Efficient generation of linear secret sharing scheme matrices from threshold access trees. IACR Cryptol. ePrint Arch. 2010, 374 (2010)
Wang, J., Huang, C., Xiong, N.N., Wang, J.: Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system. Inf. Sci. 424, 1–26 (2018)
Thien, C.-C., Lin, J.-C.: Secret image sharing. Comput. Graph. 26(5), 765–770 (2002)
Zhou, X., Yuliang, L., Yan, X., Wang, Y., Liu, L.: Lossless and efficient polynomial-based secret image sharing with reduced shadow size. Symmetry 10(7), 249 (2018)
Yan, X., Yuliang, L., Liu, L., Wan, S., Ding, W., Liu, H.: Chinese remainder theorem-based secret image sharing for (k, n) threshold. In: Third International Conference Cloud Computing and Security, vol. 10603, pp. 433–440 (2017)
Zhou, Z., Yang, C.-N., Cao, Y., Sun, X.: Secret image sharing based on encrypted pixels. IEEE Access 6, 15021–15025 (2018)
Li, P., Yang, C.-N., Chih-Cheng, W., Kong, Q., Ma, Y.: Essential secret image sharing scheme with different importance of shadows. J. Vis. Commun. Image Represent. 24(7), 1106–1114 (2013)
Li, P., Yang, C.-N., Zhou, Z.: Essential secret image sharing scheme with the same size of shadows. Digit. Signal Process. 50, 51–60 (2016)
Li, P., Liu, Z.: An improved essential secret image sharing scheme with smaller shadow size. Int. J. Digit. Crime Forensics 10(3), 78–94 (2018)
Zhen, W., Liu, Y.-N., Wang, D., Yang, C.-N.: An efficient essential secret image sharing scheme using derivative polynomial. Symmetry 11(1), 69 (2019)
Tan, L., Yuliang, L., Yan, X., Liu, L., Li, L.: Weighted secret image sharing for a (k, n) threshold based on the Chinese remainder theorem. IEEE Access 7, 59278–59286 (2019)
Liu, Z., Zhu, G., Ding, F., Kwong, S.: Weighted visual secret sharing for general access structures based on random grids. Signal Process. Image Commun. 92, 116129 (2021)
Yadav, M., Singh, R.: Essential secret image sharing approach with same size of meaningful shares. Multimedia Tools Appl. (1), 1–18 (2021). https://doi.org/10.1007/s11042-021-10625-5
Kukreja, S., Kasana, G., Kasana, S.S.: Copyright protection scheme for color images using extended visual cryptography. Comput. Electr. Eng. 91, 106931 (2021)
Nikov, V., Nikova, S.: New monotone span programs from old. IACR Cryptol. ePrint Arch. 2004, 282 (2004)
Drmac, Z., Mezic, I., Mohr, R.: Data driven Koopman spectral analysis in Vandermonde-Cauchy form via the DFT: numerical method and theoretical insights. SIAM J. Sci. Comput. 41(5), A3118–A3151 (2019)
Esfahani, N.N., Stinson, D.R.: On security properties of all-or-nothing transforms. Des. Codes Cryptogr. 89, 2857–2867 (2021). https://doi.org/10.1007/s10623-021-00958-5
Silitonga, A., Jiang, Z., Khan, N., Becker, J.: Reconfigurable module of multi-mode AES cryptographic algorithms for AP SoCs. In: IEEE Nordic Circuits and Systems Conference, pp. 1–7 (2019)
Acknowledgment
This work was supported by the National Science Foundation of China (No. 61802083, 61862011), the Natural Science Foundation of Guangxi (2018GXNSFBA281164, 2018GXNSFAA138116).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, L., Wang, J., Zhang, M., Huang, W. (2022). A Compact Secret Image Sharing Scheme Based on Flexible Secret Matrix Sharing Scheme. In: Lai, Y., Wang, T., Jiang, M., Xu, G., Liang, W., Castiglione, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2021. Lecture Notes in Computer Science(), vol 13157. Springer, Cham. https://doi.org/10.1007/978-3-030-95391-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-95391-1_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95390-4
Online ISBN: 978-3-030-95391-1
eBook Packages: Computer ScienceComputer Science (R0)