{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:49:34Z","timestamp":1773229774548,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T00:00:00Z","timestamp":1767052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T00:00:00Z","timestamp":1770681600000},"content-version":"vor","delay-in-days":42,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62401599"],"award-info":[{"award-number":["62401599"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271496"],"award-info":[{"award-number":["62271496"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Secret image sharing (SIS) possesses advantageous attributes such as loss tolerance, offering a promising solution for image protection. However, the issue remains unresolved, which is the trade-off between the transmission or storage overhead of shadow images and the concealment of secret distribution. This paper designs a novel polynomial splitting framework and proposes the first SIS scheme with multi-sized shadow images. By splitting the original polynomial into various levels containing different numbers of sub-polynomials, the proposed scheme enables the generation of multi-sized shadow images. Moreover, since polynomial splitting is compatible with image bit-plane decomposition, we introduce the first progressive secret image sharing scheme with multi-sized shadow images (PSIS-MS). The secret image can be recovered by integrating multi-sized shadow images, with the visual fidelity of the recovered image progressively enhancing as the quantity of shadow images increases. The proposed schemes generate multi-sized shadow images with an average size smaller than the original image, reducing communication overhead and enhancing the concealment of secret distribution. Theoretical analysis and experimental comparison demonstrate the validity of the proposed schemes.<\/jats:p>","DOI":"10.1007\/s44443-025-00424-5","type":"journal-article","created":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T06:32:57Z","timestamp":1767076377000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secret image sharing with multi-sized shadow images: Balancing concealment and communication overhead"],"prefix":"10.1007","volume":"38","author":[{"given":"Guozheng","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3923-8218","authenticated-orcid":false,"given":"Rui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Xuehu","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Ding","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,30]]},"reference":[{"key":"424_CR1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/J.JISA.2017.01.001","volume":"33","author":"T Bhattacharjee","year":"2017","unstructured":"Bhattacharjee T, Rout RK, Maity SP (2017) Affine boolean classification in secret image sharing for progressive quality access control. J Inf Secur Appl 33:16\u201329. https:\/\/doi.org\/10.1016\/J.JISA.2017.01.001","journal-title":"J Inf Secur Appl"},{"key":"424_CR2","doi-asserted-by":"publisher","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. In: 1979 international workshop on managing requirements knowledge, IEEE New York USA, pp 313\u2013318. https:\/\/doi.org\/10.1109\/MARK.1979.8817296","DOI":"10.1109\/MARK.1979.8817296"},{"key":"424_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/J.CSI.2024.103969","volume":"93","author":"C Cai","year":"2025","unstructured":"Cai C, Peng C, Tang H, Xiao B, Tan W (2025) DWTAT-DASIS: Fusion of discrete wavelet transform and access tree for distributed authentication in secret image sharing. Comput Stand Interfaces 93:103969. https:\/\/doi.org\/10.1016\/J.CSI.2024.103969","journal-title":"Comput Stand Interfaces"},{"issue":"8","key":"424_CR4","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1049\/IET-IPR.2015.0568","volume":"10","author":"C Chang","year":"2016","unstructured":"Chang C, Liu Y, Wu H (2016) Distortion-free secret image sharing method with two meaningful shadows. IET Image Process 10(8):590\u2013597. https:\/\/doi.org\/10.1049\/IET-IPR.2015.0568","journal-title":"IET Image Process"},{"issue":"4","key":"424_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/S00530-024-01393-X","volume":"30","author":"H Chen","year":"2024","unstructured":"Chen H, Xiong L, Yang C (2024) Progressive secret image sharing based on boolean operations and polynomial interpolations. Multim Syst 30(4):189. https:\/\/doi.org\/10.1007\/S00530-024-01393-X","journal-title":"Multim Syst"},{"key":"424_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/J.JISA.2022.103233","volume":"68","author":"J Cheng","year":"2022","unstructured":"Cheng J, Yan X, Liu L, Sun Y, Xing F (2022) Comprehensive reversible secret image sharing with palette cover images. J Inf Secur Appl 68:103233. https:\/\/doi.org\/10.1016\/J.JISA.2022.103233","journal-title":"J Inf Secur Appl"},{"issue":"13","key":"424_CR7","doi-asserted-by":"publisher","first-page":"23933","DOI":"10.1109\/JIOT.2025.3555380","volume":"12","author":"G Fang","year":"2025","unstructured":"Fang G, Wang F, Zhao C, Qin C, Chang C, Chang C (2025) Reversible data hiding with secret encrypted image sharing and adaptive coding. IEEE Internet Things J 12(13):23933\u201323945. https:\/\/doi.org\/10.1109\/JIOT.2025.3555380","journal-title":"IEEE Internet Things J"},{"issue":"10","key":"424_CR8","doi-asserted-by":"publisher","first-page":"11903","DOI":"10.1007\/S11042-017-4841-4","volume":"77","author":"M Ghebleh","year":"2018","unstructured":"Ghebleh M, Kanso AA (2018) A novel secret image sharing scheme using large primes. Multim Tools Appl 77(10):11903\u201311923. https:\/\/doi.org\/10.1007\/S11042-017-4841-4","journal-title":"Multim Tools Appl"},{"key":"424_CR9","doi-asserted-by":"publisher","unstructured":"Hilmi A, Mezroui S, Oualkadi AE (20223) A secret image sharing based on logistic-chebyshev chaotic map and chinese remainder theorem. Comput Sci J Moldova 31(1):86\u2013110 https:\/\/doi.org\/10.56415\/csjm.v31.05","DOI":"10.56415\/csjm.v31.05"},{"key":"424_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/J.JISA.2019.06.003","volume":"47","author":"Y Hu","year":"2019","unstructured":"Hu Y, Liu Y (2019) A progressively essential secret image sharing scheme using hierarchy shadow. J Inf Secur Appl 47:371\u2013376. https:\/\/doi.org\/10.1016\/J.JISA.2019.06.003","journal-title":"J Inf Secur Appl"},{"issue":"12","key":"424_CR11","doi-asserted-by":"publisher","first-page":"12849","DOI":"10.1109\/TCSVT.2024.3435724","volume":"34","author":"X Jia","year":"2024","unstructured":"Jia X, Yu T, Luo X, Wang D, Zhou H (2024) Maximizing contrast in xor-based visual cryptography schemes. IEEE Trans Circuits Syst Video Technol 34(12):12849\u201312861. https:\/\/doi.org\/10.1109\/TCSVT.2024.3435724","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"424_CR12","doi-asserted-by":"publisher","first-page":"10446","DOI":"10.1109\/TMM.2024.3407694","volume":"26","author":"Y Jiang","year":"2024","unstructured":"Jiang Y, Chen K, Yan W, Yan X, Yang G, Zeng K (2024) Robust secret image sharing resistant to JPEG recompression based on stable block condition. IEEE Trans Multim 26:10446\u201310461. https:\/\/doi.org\/10.1109\/TMM.2024.3407694","journal-title":"IEEE Trans Multim"},{"issue":"4","key":"424_CR13","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1109\/TCSVT.2021.3081575","volume":"32","author":"Y Ke","year":"2022","unstructured":"Ke Y, Zhang M, Zhang X, Liu J, Su T, Yang X (2022) A reversible data hiding scheme in encrypted domain for secret image sharing based on chinese remainder theorem. IEEE Trans Circuits Syst Video Technol 32(4):2469\u20132481. https:\/\/doi.org\/10.1109\/TCSVT.2021.3081575","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"issue":"1","key":"424_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/S11554-016-0621-Z","volume":"14","author":"P Li","year":"2018","unstructured":"Li P, Yang C, Kong Q (2018) A novel two-in-one image secret sharing scheme based on perfect black visual cryptography. J Real Time Image Process 14(1):41\u201350. https:\/\/doi.org\/10.1007\/S11554-016-0621-Z","journal-title":"J Real Time Image Process"},{"key":"424_CR15","doi-asserted-by":"publisher","unstructured":"Li X, Fu Z, Gao Y, Yu B (2025) An enhanced image protection framework: polynomial-based secret sharing meets information hiding. J King Saud Univ Comput Inf Sci 37(6). https:\/\/doi.org\/10.1007\/S44443-025-00143-X","DOI":"10.1007\/S44443-025-00143-X"},{"key":"424_CR16","doi-asserted-by":"publisher","unstructured":"Lin CS, Chen CC, Chen YC (2021) Xor-based progressively secret image sharing. Mathematics. 9(6). https:\/\/doi.org\/10.3390\/math9060612","DOI":"10.3390\/math9060612"},{"key":"424_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/J.JISA.2025.104154","volume":"93","author":"Y Liu","year":"2025","unstructured":"Liu Y, Lu Y, Wang R, Yu Y, Yan X (2025) Multi-image secret sharing for general access structure without size expansion. J Inf Secur Appl 93:104154. https:\/\/doi.org\/10.1016\/J.JISA.2025.104154","journal-title":"J Inf Secur Appl"},{"key":"424_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/J.JISA.2024.103709","volume":"81","author":"Z Liu","year":"2024","unstructured":"Liu Z, Zhu G, Zhang Y, Zhang H, Kwong S (2024) An efficient cheating-detectable secret image sharing scheme with smaller share sizes. J Inf Secur Appl 81:103709. https:\/\/doi.org\/10.1016\/J.JISA.2024.103709","journal-title":"J Inf Secur Appl"},{"key":"424_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/J.JISA.2024.103869","volume":"85","author":"S Luo","year":"2024","unstructured":"Luo S, Liu Y, Yan X, Sun Y (2024) Robust secret color image sharing anti-cropping and tampering in shares. J Inf Secur Appl 85:103869. https:\/\/doi.org\/10.1016\/J.JISA.2024.103869","journal-title":"J Inf Secur Appl"},{"key":"424_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/J.SIGPRO.2023.108931","volume":"206","author":"S Luo","year":"2023","unstructured":"Luo S, Liu Y, Yan X, Yu Y (2023) Secret image sharing scheme with lossless recovery and high efficiency. Signal Process 206:108931. https:\/\/doi.org\/10.1016\/J.SIGPRO.2023.108931","journal-title":"Signal Process"},{"key":"424_CR21","doi-asserted-by":"publisher","unstructured":"Naor M, Shamir A (1994) Visual cryptography. In: Santis AD (ed) Advances in cryptology - EUROCRYPT \u201994 workshop on the theory and application of cryptographic techniques May 9-12. Lecture Notes in Computer Science, vol 950. Springer Perugia Italy, pp 1\u201312. https:\/\/doi.org\/10.1007\/BFB0053419","DOI":"10.1007\/BFB0053419"},{"key":"424_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22:612\u2013613. https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun ACM"},{"issue":"3","key":"424_CR23","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/J.PATCOG.2006.02.025","volume":"40","author":"SJ Shyu","year":"2007","unstructured":"Shyu SJ (2007) Image encryption by random grids. Pattern Recognit 40(3):1014\u20131031. https:\/\/doi.org\/10.1016\/J.PATCOG.2006.02.025","journal-title":"Pattern Recognit"},{"key":"424_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2020.102996","volume":"74","author":"S Sridhar","year":"2021","unstructured":"Sridhar S, Sudha GF (2021) Two in one image secret sharing scheme (tioisss) for extended progressive visual cryptography using simple modular arithmetic operations. J Vis Commun Image Represent 74:102996. https:\/\/doi.org\/10.1016\/j.jvcir.2020.102996","journal-title":"J Vis Commun Image Represent"},{"key":"424_CR25","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/S0097-8493(02)00131-0","volume":"26","author":"CC Thien","year":"2002","unstructured":"Thien CC, Lin JC (2002) Secret image sharing. Comput Graph 26:765\u2013770. https:\/\/doi.org\/10.1016\/S0097-8493(02)00131-0","journal-title":"Comput Graph"},{"key":"424_CR26","doi-asserted-by":"publisher","first-page":"9819","DOI":"10.1109\/TIFS.2024.3477265","volume":"19","author":"R Wang","year":"2024","unstructured":"Wang R, Li L, Yang G, Yan X, Yan W (2024) Secret cracking and security enhancement for the image application of crt-based secret sharing. IEEE Trans Inf Forensics Secur 19:9819\u20139834. https:\/\/doi.org\/10.1109\/TIFS.2024.3477265","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"424_CR27","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/TMM.2023.3282573","volume":"26","author":"X Wu","year":"2024","unstructured":"Wu X, Feng X (2024) Size invariant visual cryptography schemes with evolving threshold access structures. IEEE Trans Multim 26:1488\u20131503. https:\/\/doi.org\/10.1109\/TMM.2023.3282573","journal-title":"IEEE Trans Multim"},{"key":"424_CR28","doi-asserted-by":"publisher","unstructured":"Wu X, Yang C, Li J (2021) Secure image secret sharing over distributed cloud network. Signal Process 178:107768. https:\/\/doi.org\/10.1016\/J.SIGPRO.2020.107768","DOI":"10.1016\/J.SIGPRO.2020.107768"},{"key":"424_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/J.DSP.2023.104273","volume":"143","author":"D Xie","year":"2023","unstructured":"Xie D, Zhu H, Chen F, Wu B, Yang J (2023) A compressed sensing-based progressive secret image sharing scheme and security analysis. Digit Signal Process 143:104273. https:\/\/doi.org\/10.1016\/J.DSP.2023.104273","journal-title":"Digit Signal Process"},{"issue":"11","key":"424_CR30","doi-asserted-by":"publisher","first-page":"10987","DOI":"10.1109\/TCSVT.2024.3413024","volume":"34","author":"L Xiong","year":"2024","unstructured":"Xiong L, Ding R, Yang CN, Fu Z (2024) Invertible secret image sharing with authentication for embedding color palette image into true color image. IEEE Trans Circuits Syst Video Technol 34(11):10987\u201310999. https:\/\/doi.org\/10.1109\/TCSVT.2024.3413024","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"424_CR31","doi-asserted-by":"publisher","unstructured":"Xiong L, Han X, Yang C (20212) CP-PSIS: CRT and polynomial-based progressive secret image sharing. Signal Process 185:108064. https:\/\/doi.org\/10.1016\/J.SIGPRO.2021.108064","DOI":"10.1016\/J.SIGPRO.2021.108064"},{"issue":"7","key":"424_CR32","doi-asserted-by":"publisher","first-page":"2896","DOI":"10.1109\/TCSVT.2020.3025527","volume":"31","author":"X Yan","year":"2021","unstructured":"Yan X, Lu Y, Yang CN, Zhang X, Wang S (2021) A common method of share authentication in image secret sharing. IEEE Trans Circuits Syst Video Technol 31(7):2896\u20132908. https:\/\/doi.org\/10.1109\/TCSVT.2020.3025527","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"issue":"9","key":"424_CR33","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1016\/j.optcom.2009.12.077","volume":"283","author":"CN Yang","year":"2010","unstructured":"Yang CN, Huang SM (2010) Constructions and properties of k out of n scalable secret image sharing. Opt Commun 283(9):1750\u20131762. https:\/\/doi.org\/10.1016\/j.optcom.2009.12.077","journal-title":"Opt Commun"},{"key":"424_CR34","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/J.JVCIR.2018.11.031","volume":"58","author":"X Yan","year":"2019","unstructured":"Yan X, Lu Y (2019) Generalized general access structure in secret image sharing. J Vis Commun Image Represent 58:89\u2013101. https:\/\/doi.org\/10.1016\/J.JVCIR.2018.11.031","journal-title":"J Vis Commun Image Represent"},{"key":"424_CR35","doi-asserted-by":"publisher","first-page":"3848","DOI":"10.1109\/TIFS.2020.3001735","volume":"15","author":"X Yan","year":"2020","unstructured":"Yan X, Lu Y, Liu L, Song X (2020) Reversible image secret sharing. IEEE Trans Inf Forensics Secur 15:3848\u20133858. https:\/\/doi.org\/10.1109\/TIFS.2020.3001735","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"424_CR36","doi-asserted-by":"publisher","unstructured":"Zhang S, Miao F (2020) Secret image sharing based on chinese remainder theorem over a polynomial ring. In: Chen X, Yan H, Yan Q, Zhang X (eds) Machine learning for cyber security - 3rd international conference ML4CS proceedings Part I. Lecture Notes in Computer Science, vol12486. Springer Guangzhou China, pp 634\u2013643. https:\/\/doi.org\/10.1007\/978-3-030-62223-7_55","DOI":"10.1007\/978-3-030-62223-7_55"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00424-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00424-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00424-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:39:57Z","timestamp":1773153597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00424-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,30]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00424-5","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,30]]},"assertion":[{"value":"27 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"61"}}