{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T15:24:49Z","timestamp":1785770689380,"version":"3.56.0"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Displays"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.displa.2025.103264","type":"journal-article","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T01:01:09Z","timestamp":1761354069000},"page":"103264","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Secret image sharing in encrypted domain based on chaos theory and Chinese Remainder Theorem"],"prefix":"10.1016","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3159-2497","authenticated-orcid":false,"given":"Erdem","family":"Yavuz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.displa.2025.103264_b0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.jvcir.2023.104013","article-title":"Secret image sharing in the encrypted domain","volume":"98","author":"Wang","year":"2024","journal-title":"J. Vis. Commun. Image Represent."},{"key":"10.1016\/j.displa.2025.103264_b0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2023.108931","article-title":"Secret image sharing scheme with lossless recovery and high efficiency","volume":"206","author":"Luo","year":"2023","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0015","doi-asserted-by":"crossref","first-page":"373","DOI":"10.3390\/e20050373","article-title":"An efficient big data anonymization algorithm based on chaos and perturbation techniques","volume":"20","author":"Eyupoglu","year":"2018","journal-title":"Entropy"},{"key":"10.1016\/j.displa.2025.103264_b0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2022.107924","article-title":"Practical attacks on a class of secret image sharing schemes based on Chinese Remainder Theorem","volume":"100","author":"Sahoo","year":"2022","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.displa.2025.103264_b0025","doi-asserted-by":"crossref","unstructured":"A. Shamir, How to share a secret, Commun. ACM 22 (11) (1979) 612\u2013613. ISSN 0001-0782.","DOI":"10.1145\/359168.359176"},{"key":"10.1016\/j.displa.2025.103264_b0030","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, in: Proc. Natl. Comput. Conf., vol. 88, 1979, p. 317.","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"10.1016\/j.displa.2025.103264_b0035","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","article-title":"A modular approach to key safeguarding","volume":"29","author":"Asmuth","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.displa.2025.103264_b0040","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":"10.1016\/j.displa.2025.103264_b0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2022.108882","article-title":"Secret image sharing by using multi-prime modular arithmetic","volume":"205","author":"Yang","year":"2023","journal-title":"Signal Process."},{"issue":"2","key":"10.1016\/j.displa.2025.103264_b0050","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1109\/COMST.2023.3263921","article-title":"Covert communications: a comprehensive survey","volume":"25","author":"Chen","year":"2023","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.displa.2025.103264_b0055","doi-asserted-by":"crossref","first-page":"25295","DOI":"10.1007\/s11042-018-5785-z","article-title":"A turtle shell-based visual secret sharing scheme with reversibility and authentication","volume":"77","author":"Liu","year":"2018","journal-title":"Multimed. Tools Appl."},{"issue":"1","key":"10.1016\/j.displa.2025.103264_b0060","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s11042-019-08077-z","article-title":"A lightweight authenticable visual secret sharing scheme based on turtle shell structure matrix","volume":"79","author":"Li","year":"2020","journal-title":"Multimed. Tools Appl."},{"key":"10.1016\/j.displa.2025.103264_b0065","doi-asserted-by":"crossref","first-page":"130405","DOI":"10.1109\/ACCESS.2020.3009410","article-title":"A reversible secret image sharing scheme based on stick insect matrix","volume":"8","author":"Gao","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.displa.2025.103264_b0070","doi-asserted-by":"crossref","first-page":"11903","DOI":"10.1007\/s11042-017-4841-4","article-title":"A novel secret image sharing scheme using large primes","volume":"77","author":"Ghebleh","year":"2018","journal-title":"Multimed. Tools Appl."},{"issue":"2","key":"10.1016\/j.displa.2025.103264_b0075","doi-asserted-by":"crossref","first-page":"120","DOI":"10.4018\/IJDCF.2018040107","article-title":"Polynomial-based secret image sharing scheme with fully lossless recovery","volume":"10","author":"Ding","year":"2018","journal-title":"Int. J. Digit. Crime Forensics (IJDCF)"},{"key":"10.1016\/j.displa.2025.103264_b0080","doi-asserted-by":"crossref","unstructured":"M.K. Sardar, A. Adhikari, A new lossless secret image sharing scheme for grayscale images with small shadow size, in: Proc. Int. Conf. Front. Comput. Syst., Springer Singapore, Singapore, 2021, pp. 701\u2013709.","DOI":"10.1007\/978-981-15-7834-2_65"},{"issue":"7","key":"10.1016\/j.displa.2025.103264_b0085","doi-asserted-by":"crossref","DOI":"10.3390\/sym10070249","article-title":"Lossless and efficient polynomial-based secret image sharing with reduced shadow size","volume":"10","author":"Zhou","year":"2018","journal-title":"Symmetry"},{"key":"10.1016\/j.displa.2025.103264_b0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.jvcir.2024.104282","article-title":"Secret image sharing with distinct covers based on improved Cycling-XOR","volume":"104","author":"Lin","year":"2024","journal-title":"J. Vis. Commun. Image Represent."},{"key":"10.1016\/j.displa.2025.103264_b0095","first-page":"80","article-title":"Chinese remainder theorem-based two-in-one image secret sharing with three decoding options, Digit","volume":"82","author":"Yan","year":"2018","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.displa.2023.102455","article-title":"VSBSIS: a verifiable SVD-based secret image sharing scheme for lossless and efficient reconstruction","volume":"78","author":"Maity","year":"2023","journal-title":"Displays"},{"key":"10.1016\/j.displa.2025.103264_b0105","article-title":"An efficient cheating-detectable secret image sharing scheme with smaller share sizes","volume":"81","author":"Liu","year":"2024","journal-title":"J. Inf. Secur. Appl."},{"key":"10.1016\/j.displa.2025.103264_b0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109861","article-title":"Meaningful secret image sharing with improved visual quality","volume":"230","author":"Wang","year":"2025","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0115","article-title":"A new parallel processing architecture for accelerating image encryption based on chaos","volume":"63","author":"Yavuz","year":"2021","journal-title":"J. Inf. Secur. Appl."},{"key":"10.1016\/j.displa.2025.103264_b0120","unstructured":"SIPI Image Database, University of Southern California Signal and Image Processing Institute. http:\/\/sipi.usc.edu\/database\/, (accessed 6 June 2024)."},{"key":"10.1016\/j.displa.2025.103264_b0125","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.sigpro.2017.03.011","article-title":"A new color image encryption using combination of the 1D chaotic map","volume":"138","author":"Pak","year":"2017","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0130","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.compbiomed.2016.03.020","article-title":"Chaos based crossover and mutation for securing DICOM image","volume":"72","author":"Ravichandran","year":"2016","journal-title":"Comput. Biol. Med."},{"issue":"8","key":"10.1016\/j.displa.2025.103264_b0135","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/TNB.2017.2780881","article-title":"DNA chaos blend to secure medical privacy","volume":"16","author":"Ravichandran","year":"2017","journal-title":"IEEE t. Nanobiosci."},{"key":"10.1016\/j.displa.2025.103264_b0140","series-title":"Chaotic Dynamics: An Introduction","author":"Baker","year":"1996"},{"key":"10.1016\/j.displa.2025.103264_b0145","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.optlaseng.2016.10.019","article-title":"Color image encryption based on hybrid hyper-chaotic system and cellular automata","volume":"90","author":"Niyat","year":"2017","journal-title":"Opt. Lasers Eng."},{"key":"10.1016\/j.displa.2025.103264_b0150","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.sigpro.2019.02.016","article-title":"A new hybrid digital chaotic system with applications in image encryption","volume":"160","author":"Alawida","year":"2019","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.bspc.2023.105521","article-title":"Separable and reversible data hiding scheme for medical images using modified Logistic and interpolation","volume":"87","author":"Xiong","year":"2024","journal-title":"Biomed. Signal Process. Control"},{"issue":"2","key":"10.1016\/j.displa.2025.103264_b0160","first-page":"31","article-title":"NPCR and UACI randomness tests for image encryption","volume":"1","author":"Wu","year":"2011","journal-title":"Cyber J. Sel. Areas Telecommun."},{"issue":"3","key":"10.1016\/j.displa.2025.103264_b0165","doi-asserted-by":"crossref","first-page":"8","DOI":"10.4236\/jcc.2019.73002","article-title":"Image quality assessment through FSIM, SSIM, MSE and PSNR\u2014a comparative study","volume":"7","author":"Sara","year":"2019","journal-title":"J. Comput. Commun."},{"issue":"19","key":"10.1016\/j.displa.2025.103264_b0170","doi-asserted-by":"crossref","first-page":"28731","DOI":"10.1007\/s11042-021-11104-7","article-title":"A lossless secret image sharing scheme using a larger finite field","volume":"80","author":"Hu","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"10.1016\/j.displa.2025.103264_b0175","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2025.110056","article-title":"A puzzle matrix oriented secret sharing scheme for dual images with reversibility","volume":"236","author":"Lin","year":"2025","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109423","article-title":"Robust secret image sharing scheme with improved anti-noise capability","volume":"219","author":"Luo","year":"2024","journal-title":"Signal Process."},{"key":"10.1016\/j.displa.2025.103264_b0185","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1186\/s13635-024-00185-0","article-title":"Universal share-based two-in-one multi-image secret sharing scheme by rotating random grids","volume":"1","author":"Rabari","year":"2025","journal-title":"EURASIP J. Inf. Secur."}],"container-title":["Displays"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141938225003014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141938225003014?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T14:06:31Z","timestamp":1765029991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141938225003014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":37,"alternative-id":["S0141938225003014"],"URL":"https:\/\/doi.org\/10.1016\/j.displa.2025.103264","relation":{},"ISSN":["0141-9382"],"issn-type":[{"value":"0141-9382","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Secret image sharing in encrypted domain based on chaos theory and Chinese Remainder Theorem","name":"articletitle","label":"Article Title"},{"value":"Displays","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.displa.2025.103264","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103264"}}