Relations Between Secret Sharing and Secret Image Sharing
Secret sharing (SS) for (k, n) threshold generates secret data into n shadows, where any k or more shadows can reconstruct the secret while any \(k-1\) or less shadows reconstruct nothing of the secret. SS is useful for cloud computing security, block chain security and so on. Since nowadays image covers more information, secret image sharing (SIS) is studied widely. Although most SIS principles are derived from SS and SIS belongs to SS, SIS has its specific features comparing to SS due to image characteristics, such as, pixel value range, region relationship and so on. In this paper, first we discuss the relations between SIS and SS, where differences between them are mainly considered. Then, some typical sharing principles are employed to further indicate the differences and analyze the possible ways to deal with the issues when directly applying SS to SIS. Finally, we perform experiments to verify our analyses.
KeywordsInformation hiding Secret sharing Secret image sharing Polynomial Chinese remainder theorem
The authors would like to thank the anonymous reviewers for their valuable comments. This work is supported by the National Natural Science Foundation of China (Grant Number: 61602491) and Key Program of National University of Defense Technology.
- 2.Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, New York, USA, pp. 313–317. IEEE Computer Society. IEEE (1979)Google Scholar
- 5.Yan, X., Lu, Y., Liu, L., Wan, S., Ding, W., Liu, H.: Security analysis of secret image sharing. In: Proceedings of the Data Science: Third International Conference of Pioneering Computer Scientists, Engineers and Educators, ICPCSEE 2017, Part I, Changsha, China, 22–24 September 2017, pp. 305–316 (2017)Google Scholar
- 7.Naor, M., Shamir, A.: Visual cryptography. In: Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology-EUROCRYPT 1994. Lecture Notes in Computer Science, Perugia, Italy, 9–12 May 1994, pp. 1–12. Springer (1995)Google Scholar
- 21.Fu, Z.x., Yu, B.: Visual cryptography and random grids schemes. In: Shi, Y., Kim, H.J., Pérez-González, F. (eds.) Digital-Forensics and Watermarking, pp. 109–122. Springer, Heidelberg (2014)Google Scholar
- 23.Yan, X., Wang, S., Li, L., El-Latif, A.A.A., Wei, Z., Niu, X.: A new assessment measure of shadow image quality based on error diffusion techniques. J. Inf. Hiding Multimedia Signal Process. (JIHMSP) 4(2), 118–126 (2013)Google Scholar
- 29.Yan, X., Lu, Y., Liu, L., Liu, J., Yang, G.: Secret data fusion based on Chinese remainder theorem. In: 2018 3rd IEEE International Conference on Image, Vision and Computing, pp. 380–385. IEEE (2018)Google Scholar
- 30.Yan, X., Lu, Y., Liu, L., Wan, S., Ding, W., Liu, H.: Chinese remainder theorem-based secret image sharing for (k, n) threshold. In: Cloud Computing and Security: Third International Conference, ICCCS 2017, Part II. Revised Selected Papers, Nanjing, China, 16–18 June 2017, pp. 433–440 (2017)Google Scholar
- 35.Yan, X., Lu, Y., Liu, L., Wan, S.: Random grids-based threshold visual secret sharing with improved visual quality. In: Digital Forensics and Watermarking: 15th International Workshop, IWDW 2017. Revised Selected Papers, Beijing, China, 17–19 September 2016, pp. 209–222 (2016)Google Scholar