{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:11:49Z","timestamp":1760346709591,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T00:00:00Z","timestamp":1534291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602491"],"award-info":[{"award-number":["61602491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Program of the National University of Defense Technology","award":["ZK-17-02-07"],"award-info":[{"award-number":["ZK-17-02-07"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Secret image sharing (SIS) with small-sized shadow images has many benefits, such as saving storage space, improving transmission time, and achieving information hiding. When adjacent pixel values in an image are similar to each other, the secret image will be leaked when all random factors of an SIS scheme are utilized for achieving small sizes of shadow images. Most of the studies in this area suffer from an inevitable problem: auxiliary encryption is crucial in ensuring the security of those schemes. In this paper, an SIS scheme with small-sized shadow images based on the Chinese remainder theorem (CRT) is proposed. The size of shadow images can be reduced to nearly     1 \/ k     of the original secret image. By adding random bits to binary representations of the random factors in the CRT, auxiliary encryption is not necessary for this scheme. Additionally, reasonable modifications of the random factors make it possible to incorporate all advantages of the CRT as well, including a (    k , n    ) threshold, lossless recovery, and low computation complexity. Analyses and experiments are provided to demonstrate the effectiveness of the proposed scheme.<\/jats:p>","DOI":"10.3390\/sym10080340","type":"journal-article","created":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T10:40:07Z","timestamp":1534329607000},"page":"340","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Chinese Remainder Theorem-Based Secret Image Sharing with Small-Sized Shadow Images"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2778-7486","authenticated-orcid":false,"given":"Jinrui","family":"Chen","sequence":"first","affiliation":[{"name":"National University of Defense Technology, Hefei 230037, China"}]},{"given":"Kesheng","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei 230037, China"}]},{"given":"Xuehu","family":"Yan","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei 230037, China"}]},{"given":"Lintao","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei 230037, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4381-4413","authenticated-orcid":false,"given":"Xuan","family":"Zhou","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei 230037, China"}]},{"given":"Longdan","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei 230037, China"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Li, P., Liu, Z., and Yang, C.N. (2018). A construction method of (t, k, n)-essential secret image sharing scheme. 65, 210\u2013220.","DOI":"10.1016\/j.image.2018.04.002"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Liu, X., Wang, S., Yan, X., and Zhang, W. (2017). Random grid-based threshold visual secret sharing with improved visual quality and lossless recovery ability. Multimed. Tools Appl.","DOI":"10.1007\/s11042-017-5482-3"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R. (1979, January 6\u20138). Safeguarding cryptographic keys. Proceedings of the IEEE National Computer Conference, Chicago, IL, USA.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/S0097-8493(02)00131-0","article-title":"Secret image sharing","volume":"26","author":"Thien","year":"2002","journal-title":"Comput. Graph."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1049\/ip-vis:20000104","article-title":"Spatial-domain image hiding using image differencing","volume":"147","author":"Wu","year":"2002","journal-title":"IEEE Proc. Vis. Image Signal Process."},{"key":"ref_7","unstructured":"Chae, J.J., Mukherjee, D., and Manjunath, B.S. (1998, January 22\u201324). A Robust Data Hiding Technique Using Multidimensional Lattices. Proceedings of the IEEE International Forum on Research and Technology Advances in Digital Libraries, 1998 (ADL 98), Santa Barbara, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"16369","DOI":"10.1007\/s11042-016-3917-x","article-title":"An efficient (t, n)\u2013threshold secret image sharing scheme","volume":"76","author":"Kanso","year":"2017","journal-title":"Multimed. Tools Appl."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zou, B., Li, M., Wang, H., Song, X., Xie, W., and Lu, Z. (2017). Security Analysis of Secret Image Sharing. Data Science, Proceedings of the Third International Conference of Pioneering Computer Scientists, Engineers and Educators (ICPCSEE 2017), Changsha, China, 22\u201324 September 2017, Springer. Proceedings Part I.","DOI":"10.1007\/978-981-10-6385-5"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Guo, T., Liu, F., Wu, C.K., Yang, C.N., Wang, W., and Ren, Y.W. (2013, January 20\u201322). Threshold Secret Image Sharing. Proceedings of the 15th International Conference on Information and Communications Security, Beijing, China.","DOI":"10.1007\/978-3-319-02726-5_29"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"15021","DOI":"10.1109\/ACCESS.2018.2811722","article-title":"Secret Image Sharing based on Encrypted Pixels","volume":"6","author":"Zhou","year":"2018","journal-title":"IEEE Access"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ahmadian, A.M., and Amirmazlaghani, M. (2017, January 2\u20134). Computationally secure secret image sharing. Proceedings of the 2017 Iranian Conference on the Electrical Engineering, Tehran, Iran.","DOI":"10.1109\/IranianCEE.2017.7985430"},{"key":"ref_13","first-page":"246","article-title":"A lossy secret color image sharing scheme with small shadows and error-resilient capability","volume":"6","author":"Liu","year":"2015","journal-title":"J. Inf. Hiding Multimed. Signal Process."},{"key":"ref_14","unstructured":"Mignotte, M. (April, January 29). How to Share a Secret. Proceedings of the Conference on Cryptography, Berlin, Germany."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"7087","DOI":"10.1007\/s11042-016-3364-8","article-title":"A secret image sharing scheme based on piecewise linear chaotic map and Chinese remainder theorem","volume":"76","author":"Hua","year":"2017","journal-title":"Multimed. Tools Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","article-title":"A modular approach to key safeguarding","volume":"30","author":"Asmuth","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Ulutas, M., Nabiyev, V.V., and Ulutas, G. (2009, January 14\u201316). A new secret image sharing technique based on Asmuth Bloom\u2019s scheme. Proceedings of the International Conference on Application of Information and Communication Technologies (AICT 2009), Baku, Azerbaijan.","DOI":"10.1109\/ICAICT.2009.5372571"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Sun, X., Chao, H.C., You, X., and Bertino, E. (2017). Chinese Remainder Theorem-Based Secret Image Sharing for (k, n) Threshold. Cloud Computing and Security, Proceedings of the Third International Conference ICCCS 2017, Nanjing, China, 16\u201318 June 2017, Springer. Revised Selected Papers, Part II.","DOI":"10.1007\/978-3-319-68542-7"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/8\/340\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:18:54Z","timestamp":1760195934000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/8\/340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,15]]},"references-count":18,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2018,8]]}},"alternative-id":["sym10080340"],"URL":"https:\/\/doi.org\/10.3390\/sym10080340","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,8,15]]}}}