{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:55:39Z","timestamp":1760151339120,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>(k,n)-threshold secret image sharing (SIS) protects an image by dividing it into n shadow images. The secret image will be recovered as we gather k or more shadow images. In complex networks, the security, robustness and efficiency of protecting images draws more and more attention. Thus, we realize multiple secret images sharing (MSIS) by information hiding in the sharing domain (IHSD) and propose a novel and general (n,n)-threshold IHSD-MSIS scheme (IHSD-MSISS), which can share and recover two secret images simultaneously. The proposed scheme spends less cost on managing and identifying shadow images, and improves the ability to prevent malicious tampering. Moreover, it is a novel approach to transmit important images with strong associations. The superiority of (n,n)-threshold IHSD-MSISS is in fusing the sharing phases of two secret images by controlling randomness of SIS. We present a general construction model and algorithms of the proposed scheme. Sufficient theoretical analyses, experiments and comparisons show the effectiveness of the proposed scheme.<\/jats:p>","DOI":"10.3390\/e24030318","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T09:34:38Z","timestamp":1645608878000},"page":"318","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9589-8682","authenticated-orcid":false,"given":"Fengyue","family":"Xing","sequence":"first","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6388-1720","authenticated-orcid":false,"given":"Xuehu","family":"Yan","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longlong","family":"Li","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"},{"name":"Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Chien, M.C., and Hwang, J.I.G. (2012, January 16\u201318). Secret image sharing using (t, n) threshold scheme with lossless recovery. Proceedings of the 2012 5th International Congress on Image and Signal Processing, Chongqing, China.","DOI":"10.1109\/CISP.2012.6469950"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"5618","DOI":"10.1109\/TIP.2017.2738561","article-title":"Combination of Sharing Matrix and Image Encryption for Lossless (k, n) -Secret Image Sharing","volume":"26","author":"Bao","year":"2017","journal-title":"IEEE Trans. Image Process."},{"key":"ref_3","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_4","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/TCSVT.2012.2204940","article-title":"Visual Cryptograms of Random Grids for General Access Structures","volume":"23","author":"Shyu","year":"2013","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.sigpro.2014.06.011","article-title":"Threshold construction from specific cases in visual cryptography without the pixel expansion","volume":"105","author":"Yan","year":"2014","journal-title":"Signal Process."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Yan, X., Lu, Y., Liu, L., Wan, S., Ding, W., and Liu, H. (2017, January 16\u201318). Chinese Remainder Theorem-Based Secret Image Sharing for (k, n) Threshold. Proceedings of the International Conference on Cloud Computing and Security, Nanjing, China.","DOI":"10.1007\/978-3-319-68542-7_36"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11042-019-7205-4","article-title":"Polynomial-based extended secret image sharing scheme with reversible and unexpanded covers","volume":"78","author":"Liu","year":"2019","journal-title":"Multimed. Tools Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1049\/iet-ipr.2018.5648","article-title":"Application of Random Elements in Image Secret Sharing","volume":"14","author":"Yan","year":"2019","journal-title":"IET Image Process."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1186\/s13640-020-00529-z","article-title":"Applying cheating identifiable secret sharing scheme in multimedia security","volume":"2020","author":"Ma","year":"2020","journal-title":"EURASIP J. Image Video Process."},{"key":"ref_10","first-page":"3848","article-title":"Reversible Image Secret Sharing","volume":"15","author":"Yan","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4018\/IJDCF.2020070107","article-title":"A Common General Access Structure Construction Approach in Secret Image Sharing","volume":"12","author":"Yan","year":"2020","journal-title":"Int. J. Digit. Crime Forensics"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.ins.2021.03.029","article-title":"Multiparty verification in image secret sharing","volume":"562","author":"Yan","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"23284","DOI":"10.1109\/ACCESS.2021.3056893","article-title":"Robust Secret Image Sharing Scheme Against Noise in Shadow Images","volume":"9","author":"Sun","year":"2021","journal-title":"IEEE Access"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1093\/ietfec\/e89-a.5.1382","article-title":"Visual Secret Sharing Schemes for Multiple Secret Images Allowing the Rotation of Shares","volume":"89-A","author":"Iwamoto","year":"2006","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_15","unstructured":"Naidu, P.S., and Kharat, R. (2016, January 21\u201324). Secure Authentication in Online Voting System Using Multiple Image Secret Sharing. Proceedings of the International Symposium on Security in Computing and Communication, Jaipur, India."},{"key":"ref_16","unstructured":"Dastanian, R., and Shahhoseini, H.S. (2011, January 17\u201319). Multi Secret Sharing Scheme for Encrypting Two Secret Images into Two Shares. Proceedings of the 2011 International Conference on Information and Electronics Engineering, Bandung, Indonesia."},{"key":"ref_17","first-page":"45","article-title":"A new Boolean-based multiple secret image sharing scheme to share different sized secret images","volume":"33","author":"Chen","year":"2017","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"28601","DOI":"10.1007\/s11042-018-6019-0","article-title":"Circular meaningful shares based (k, n) two in one image secret sharing scheme for multiple secret images","volume":"77","author":"Sridhar","year":"2018","journal-title":"Multim. Tools Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"29089","DOI":"10.1007\/s11042-018-6304-y","article-title":"Improved multiple secret sharing using generalized chaotic image scrambling","volume":"78","author":"Prasetyo","year":"2019","journal-title":"Multim. Tools Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"13247","DOI":"10.1007\/s11042-019-08524-x","article-title":"Multiple secret image sharing with general access structure","volume":"79","author":"Chen","year":"2020","journal-title":"Multim. Tools Appl."},{"key":"ref_21","first-page":"9960998:1","article-title":"An Intragroup and Intergroup Multiple Secret Images\u2019 Sharing Scheme with Each Participant Holding One Shadow Image","volume":"2021","author":"Wang","year":"2021","journal-title":"Secur. Commun. Netw."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"102971","DOI":"10.1016\/j.jvcir.2020.102971","article-title":"A novel (k1, k2, n)-threshold two-in-one secret image sharing scheme for multiple secrets","volume":"74","author":"Liu","year":"2021","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_23","first-page":"342","article-title":"Meaningful shadows for image secret sharing with steganography and authentication techniques","volume":"5","author":"Chang","year":"2014","journal-title":"J. Inf. Hiding Multimed. Signal Process."},{"key":"ref_24","first-page":"1168","article-title":"Novel lossless morphing algorithm for secret sharing via meaningful images","volume":"7","author":"Mao","year":"2016","journal-title":"J. Inf. Hiding Multimed. Signal Process."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Xing, F., Yan, X., Yu, L., and Sun, Y. (2021). Information hiding in the sharing domain (Under revision). J. Vis. Commun. Image Reprresent., submitted.","DOI":"10.1016\/j.jvcir.2022.103520"},{"key":"ref_26","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_27","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/inco.1996.0076","article-title":"Visual cryptography for general access structures","volume":"129","author":"Ateniese","year":"1996","journal-title":"Inf. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TIFS.2011.2116782","article-title":"Embedded extended visual cryptography schemes","volume":"6","author":"Liu","year":"2011","journal-title":"Inf. Forensics Secur. IEEE Trans."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.sigpro.2014.12.002","article-title":"Generalized random grids-based threshold visual cryptography with meaningful shares","volume":"109","author":"Yan","year":"2015","journal-title":"Signal Process."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.ins.2014.03.033","article-title":"A discussion on the relationship between probabilistic visual cryptography and random grid","volume":"278","author":"Yang","year":"2014","journal-title":"Inf. Sci."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/318\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:25:50Z","timestamp":1760135150000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["e24030318"],"URL":"https:\/\/doi.org\/10.3390\/e24030318","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,2,23]]}}}