{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:29:27Z","timestamp":1760059767223,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Imaging"],"abstract":"<jats:p>In this paper, we propose an innovative essential multi-secret image sharing (EMSIS) scheme that integrates sensor data to securely and efficiently share multiple secret images of varying importance. Secret images are categorized into hierarchical levels and encoded into essential shadows and fault-tolerant non-essential shares, with access to higher-level secrets requiring higher-level essential shadows. By incorporating sensor data, such as location, time, or biometric input, into the encoding and access process, the scheme enables the context-aware and adaptive reconstruction of secrets based on real-world conditions. Experimental results demonstrate that the proposed method not only strengthens hierarchical access control, but also enhances robustness, flexibility, and situational awareness in secure image distribution systems.<\/jats:p>","DOI":"10.3390\/jimaging11070228","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T11:58:07Z","timestamp":1751975887000},"page":"228","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Essential Multi-Secret Image Sharing for Sensor Images"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5879-4048","authenticated-orcid":false,"given":"Shang-Kuan","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science & Engineering, Yuan Ze University, Taoyuan 32003, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Naor, M., and Shamir, A. (1995). Visual Cryptography, Springer.","DOI":"10.1007\/BFb0053419"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"31927","DOI":"10.1007\/s11042-021-11229-9","article-title":"An overview of visual cryptography techniques","volume":"80","author":"Ibrahim","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"103569","DOI":"10.1016\/j.jvcir.2022.103569","article-title":"A zero-watermark algorithm for multiple images based on visual cryptography and image fusion","volume":"87","author":"Wang","year":"2022","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0020-0255(98)10011-7","article-title":"Sharing secret images using shadow codebooks","volume":"111","author":"Chang","year":"1998","journal-title":"Inf. Sci."},{"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":"2466","DOI":"10.1016\/j.patcog.2005.04.002","article-title":"Fault-tolerant and progressive transmission of images","volume":"38","author":"Chen","year":"2005","journal-title":"Pattern Recognit."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"047006","DOI":"10.1117\/1.2911719","article-title":"Progressive sharing of an image","volume":"47","author":"Hung","year":"2008","journal-title":"Opt. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"31039","DOI":"10.1007\/s11042-022-12951-8","article-title":"Progressive and multi-level sharing scheme with hierarchical shadows","volume":"81","author":"Wang","year":"2022","journal-title":"Multimed. Tools Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1016\/j.patcog.2004.01.002","article-title":"Sharing and hiding secret images with size constraint","volume":"37","author":"Wu","year":"2004","journal-title":"Pattern Recognit."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TCSVT.2003.819176","article-title":"An Image-Sharing Method with User-Friendly Shadow Images","volume":"13","author":"Thien","year":"2003","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Cheng, J., Liu, L., Chen, F., and Jiang, Y. (2022). Meaningful Secret Image Sharing with Uniform Image Quality. Mathematics, 10.","DOI":"10.3390\/math10183241"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.image.2006.12.012","article-title":"Scalable secret image sharing","volume":"22","author":"Wang","year":"2007","journal-title":"Signal Process. Image Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1016\/j.optcom.2009.12.077","article-title":"Constructions and properties of k out of n scalable secret image sharing","volume":"283","author":"Yang","year":"2010","journal-title":"Opt. Commun."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1726","DOI":"10.1016\/j.jss.2011.05.008","article-title":"A general (k, n) scalable secret image sharing scheme with the smooth scalability","volume":"84","author":"Yang","year":"2011","journal-title":"J. Syst. Softw."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1002\/sec.930","article-title":"Reducing shadow size in smooth scalable secret image sharing","volume":"7","author":"Liu","year":"2014","journal-title":"Secur. Commun. Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.jvcir.2013.07.005","article-title":"Essential secret image sharing scheme with different importance of shadows","volume":"24","author":"Li","year":"2013","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.image.2014.11.003","article-title":"Reducing shadow size in essential secret image sharing by conjunctive hierarchical approach","volume":"31","author":"Yang","year":"2015","journal-title":"Signal Process. Image Commun."},{"key":"ref_18","first-page":"135","article-title":"An expandable essential secret image sharing structure","volume":"7","author":"Chen","year":"2016","journal-title":"J. Inf. Hiding Multimed. Signal Process."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"013103","DOI":"10.1117\/1.OE.55.1.013103","article-title":"Essential secret image sharing with increasable shadows","volume":"55","author":"Chen","year":"2016","journal-title":"Opt. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.jvcir.2016.04.004","article-title":"Two-layered structure for optimally essential secret image sharing scheme","volume":"38","author":"Chen","year":"2016","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.dsp.2015.12.004","article-title":"Essential secret image sharing scheme with the same size of shadows","volume":"50","author":"Li","year":"2016","journal-title":"Digit. Signal Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jvcir.2018.02.006","article-title":"Essential Secret Image Sharing Scheme with Equal-sized Shadows Generation","volume":"52","author":"Chen","year":"2018","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"22677","DOI":"10.1007\/s11042-021-10625-5","article-title":"Essential secret image sharing approach with same size of meaningful shares","volume":"81","author":"Yadav","year":"2022","journal-title":"Multimed. Tools Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.image.2018.04.002","article-title":"A construction method of (t, k, n)-essential secret image sharing scheme","volume":"65","author":"Li","year":"2018","journal-title":"Signal Process. Image Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1049\/ipr2.13006","article-title":"LWE-Based Verifiable Essential Secret Image Sharing Scheme ((t, s, k, n)-VESIS)","volume":"18","author":"Dehkordi","year":"2024","journal-title":"IET Image Process."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1967","DOI":"10.1007\/s11042-024-19033-x","article-title":"A verifiable multi-secret image sharing scheme based on DNA encryption","volume":"84","author":"Chattopadhyay","year":"2025","journal-title":"Multimed. Tools Appl."}],"container-title":["Journal of Imaging"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2313-433X\/11\/7\/228\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:06:49Z","timestamp":1760033209000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2313-433X\/11\/7\/228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,8]]},"references-count":26,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["jimaging11070228"],"URL":"https:\/\/doi.org\/10.3390\/jimaging11070228","relation":{},"ISSN":["2313-433X"],"issn-type":[{"type":"electronic","value":"2313-433X"}],"subject":[],"published":{"date-parts":[[2025,7,8]]}}}