{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:17:14Z","timestamp":1775578634889,"version":"3.50.1"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,2,28]],"date-time":"2021-02-28T00:00:00Z","timestamp":1614470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["\u00a061602491"],"award-info":[{"award-number":["\u00a061602491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2021,2,28]]},"abstract":"<jats:p>\n            A secret image is split into\u00a0\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            \u00a0shares in the generation phase of secret image sharing (SIS) for a\u00a0\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            threshold. In the recovery phase, the secret image is recovered when any\u00a0\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            \u00a0or more shares are collected, and each collected share is generally assumed to be lossless in conventional SIS during storage and transmission. However, noise will arise during real-world storage and transmission; thus, shares will experience data loss, which will also lead to data loss in the secret image being recovered. Secret image recovery in the case of lossy shares is an important issue that must be addressed in practice, which is the overall subject of this article. An SIS scheme that can recover the secret image from lossy shares is proposed in this article. First, robust SIS and its definition are introduced. Next, a robust SIS scheme for a\u00a0\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            threshold without pixel expansion is proposed based on the Chinese remainder theorem (CRT) and error-correcting codes (ECC). By screening the random numbers, the share generation phase of the proposed robust SIS is designed to implement the error correction capability without increasing the share size. Particularly in the case of collecting noisy shares, our recovery method is to some degree robust to some noise types, such as least significant bit (LSB) noise, JPEG compression, and salt-and-pepper noise. A theoretical proof is presented, and experimental results are examined to evaluate the effectiveness of our proposed method.\n          <\/jats:p>","DOI":"10.1145\/3419750","type":"journal-article","created":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T12:42:08Z","timestamp":1618576928000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Robust Secret Image Sharing Resistant to Noise in Shares"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6388-1720","authenticated-orcid":false,"given":"Xuehu","family":"Yan","sequence":"first","affiliation":[{"name":"National University of Defense Technology, Hefei, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lintao","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longlong","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuliang","family":"Lu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Hefei, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,4,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056651"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2738561"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2016.11.152"},{"key":"e_1_2_1_4_1","first-page":"7","article-title":"Efficient and robust image coding and transmission based on scrambled block compressive sensing","volume":"20","author":"Chen Z.","year":"2018","unstructured":"Z. Chen , X. Hou , X. Qian , and C. Gong . 2018 . Efficient and robust image coding and transmission based on scrambled block compressive sensing . IEEE Trans. Multimedia 20 , 7 (July 2018), 1610\u20131621. DOI:https:\/\/doi.org\/10.1109\/TMM.2017.2774004 10.1109\/TMM.2017.2774004 Z. Chen, X. Hou, X. Qian, and C. Gong. 2018. Efficient and robust image coding and transmission based on scrambled block compressive sensing. IEEE Trans. Multimedia 20, 7 (July 2018), 1610\u20131621. DOI:https:\/\/doi.org\/10.1109\/TMM.2017.2774004","journal-title":"IEEE Trans. Multimedia"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2819125"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IS3C.2016.208"},{"key":"e_1_2_1_7_1","article-title":"Secret image sharing based on chaotic map and Chinese remainder theorem","volume":"10","author":"Chunqiang Hu","year":"2012","unstructured":"Hu Chunqiang , Liao Xiaofeng , and Xiao Di . 2012 . Secret image sharing based on chaotic map and Chinese remainder theorem . Int. J. Wavel. Multires. Inf. Proc. 10 , 3 (2012), 1250023 (2012). Hu Chunqiang, Liao Xiaofeng, and Xiao Di. 2012. Secret image sharing based on chaotic map and Chinese remainder theorem. Int. J. Wavel. Multires. Inf. Proc. 10, 3 (2012), 1250023 (2012).","journal-title":"Int. J. Wavel. Multires. Inf. Proc."},{"key":"e_1_2_1_8_1","volume-title":"Nico D\u00f6ttling, Serge Fehr, and Gabriele Spini.","author":"Cramer Ronald","year":"2015","unstructured":"Ronald Cramer , Ivan Bjerre Damg\u00e5rd , Nico D\u00f6ttling, Serge Fehr, and Gabriele Spini. 2015 . Linear secret sharing schemes from error correcting codes and universal hash functions. In Advances in Cryptology - EUROCRYPT 2015, Elisabeth Oswald and Marc Fischlin (Eds.). Springer Berlin , 313\u2013336. Ronald Cramer, Ivan Bjerre Damg\u00e5rd, Nico D\u00f6ttling, Serge Fehr, and Gabriele Spini. 2015. Linear secret sharing schemes from error correcting codes and universal hash functions. In Advances in Cryptology - EUROCRYPT 2015, Elisabeth Oswald and Marc Fischlin (Eds.). Springer Berlin, 313\u2013336."},{"key":"e_1_2_1_9_1","volume-title":"A novel secret image sharing scheme using large primes. Multimedia Tools Applic. 77, 10 (01","author":"Ghebleh Mohammad","year":"2018","unstructured":"Mohammad Ghebleh and Ali Kanso . 2018. A novel secret image sharing scheme using large primes. Multimedia Tools Applic. 77, 10 (01 May 2018 ), 11903\u201311923. DOI:https:\/\/doi.org\/10.1007\/s11042-017-4841-4 10.1007\/s11042-017-4841-4 Mohammad Ghebleh and Ali Kanso. 2018. A novel secret image sharing scheme using large primes. Multimedia Tools Applic. 77, 10 (01 May 2018), 11903\u201311923. DOI:https:\/\/doi.org\/10.1007\/s11042-017-4841-4"},{"key":"e_1_2_1_10_1","volume-title":"An efficient XOR-based verifiable visual cryptographic scheme. Multimedia Tools Applic. 78, 7 (01","author":"Jia Xingxing","year":"2019","unstructured":"Xingxing Jia , Daoshun Wang , Qimeng Chu , and Zhenhua Chen . 2019. An efficient XOR-based verifiable visual cryptographic scheme. Multimedia Tools Applic. 78, 7 (01 Apr. 2019 ), 8207\u20138223. DOI:https:\/\/doi.org\/10.1007\/s11042-018-6779-6 10.1007\/s11042-018-6779-6 Xingxing Jia, Daoshun Wang, Qimeng Chu, and Zhenhua Chen. 2019. An efficient XOR-based verifiable visual cryptographic scheme. Multimedia Tools Applic. 78, 7 (01 Apr. 2019), 8207\u20138223. DOI:https:\/\/doi.org\/10.1007\/s11042-018-6779-6"},{"key":"e_1_2_1_11_1","volume-title":"Theory of Cryptography","author":"Komargodski Ilan","unstructured":"Ilan Komargodski and Anat Paskin-Cherniavsky . 2017. Evolving secret sharing: Dynamic thresholds and robustness . In Theory of Cryptography , Yael Kalai and Leonid Reyzin (Eds.). Springer International Publishing , Cham , 379\u2013393. Ilan Komargodski and Anat Paskin-Cherniavsky. 2017. Evolving secret sharing: Dynamic thresholds and robustness. In Theory of Cryptography, Yael Kalai and Leonid Reyzin (Eds.). Springer International Publishing, Cham, 379\u2013393."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2921612"},{"key":"e_1_2_1_13_1","first-page":"4","article-title":"Robust image hashing based on random Gabor filtering and dithered lattice vector quantization","volume":"21","author":"Li Y.","year":"2012","unstructured":"Y. Li , Z. Lu , C. Zhu , and X. Niu . 2012 . Robust image hashing based on random Gabor filtering and dithered lattice vector quantization . IEEE Trans. Image Proc. 21 , 4 (Apr. 2012), 1963\u20131980. DOI:https:\/\/doi.org\/10.1109\/TIP.2011.2171698 10.1109\/TIP.2011.2171698 Y. Li, Z. Lu, C. Zhu, and X. Niu. 2012. Robust image hashing based on random Gabor filtering and dithered lattice vector quantization. IEEE Trans. Image Proc. 21, 4 (Apr. 2012), 1963\u20131980. DOI:https:\/\/doi.org\/10.1109\/TIP.2011.2171698","journal-title":"IEEE Trans. Image Proc."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2116782"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2169790"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.043"},{"key":"e_1_2_1_17_1","volume-title":"Workshop on the Theory and Application of Cryptographic Techniques. Springer, 1\u201312","author":"Naor Moni","year":"1995","unstructured":"Moni Naor and Adi Shamir . 1995 . Visual cryptography. In Advances in Cryptology-EUROCRYPT\u201994 Lecture Notes in Computer Science , Workshop on the Theory and Application of Cryptographic Techniques. Springer, 1\u201312 . Moni Naor and Adi Shamir. 1995. Visual cryptography. In Advances in Cryptology-EUROCRYPT\u201994 Lecture Notes in Computer Science, Workshop on the Theory and Application of Cryptographic Techniques. Springer, 1\u201312."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2014.2316154"},{"key":"e_1_2_1_19_1","volume-title":"1st International Conference on Emerging Trends in Engineering and Technology. 11\u201314","author":"Rishiwal V.","year":"2008","unstructured":"V. Rishiwal , M. Yadav , and K. V. Arya . 2008. A robust secret image sharing scheme . In 1st International Conference on Emerging Trends in Engineering and Technology. 11\u201314 . DOI:https:\/\/doi.org\/10.1109\/ICETET. 2008 .109 10.1109\/ICETET.2008.109 V. Rishiwal, M. Yadav, and K. V. Arya. 2008. A robust secret image sharing scheme. In 1st International Conference on Emerging Trends in Engineering and Technology. 11\u201314. DOI:https:\/\/doi.org\/10.1109\/ICETET.2008.109"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_21_1","volume-title":"10th International Conference on Intelligent Systems and Control (ISCO\u201916)","author":"Shankar K.","year":"2016","unstructured":"K. Shankar and P. Eswaran . 2016. A new k out of n secret image sharing scheme in visual cryptography . In 10th International Conference on Intelligent Systems and Control (ISCO\u201916) . 1\u20136. DOI:https:\/\/doi.org\/10.1109\/ISCO. 2016 .7726969 10.1109\/ISCO.2016.7726969 K. Shankar and P. Eswaran. 2016. A new k out of n secret image sharing scheme in visual cryptography. In 10th International Conference on Intelligent Systems and Control (ISCO\u201916). 1\u20136. DOI:https:\/\/doi.org\/10.1109\/ISCO.2016.7726969"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSCC.2008.223"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-8493(02)00131-0"},{"key":"e_1_2_1_24_1","volume-title":"International Conference on Application of Information and Communication Technologies (AICT\u201909)","author":"Ulutas M.","unstructured":"M. Ulutas , V. V. Nabiyev , and G. Ulutas . 2009. A new secret image sharing technique based on Asmuth Bloom\u2019s scheme . In International Conference on Application of Information and Communication Technologies (AICT\u201909) . 1\u20135. M. Ulutas, V. V. Nabiyev, and G. Ulutas. 2009. A new secret image sharing technique based on Asmuth Bloom\u2019s scheme. In International Conference on Application of Information and Communication Technologies (AICT\u201909). 1\u20135."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/3273390.3273396"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.04.010"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2009.2024721"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344436.2344438"},{"key":"e_1_2_1_30_1","first-page":"6","article-title":"Image sharing based on Chinese remainder theorem","volume":"12","author":"Yan Weiqi","year":"2000","unstructured":"Weiqi Yan , Wei Ding , and Qi Dongxu . 2000 . Image sharing based on Chinese remainder theorem . J. North China Univ. of Tech 12 , 1 (2000), 6 \u2013 9 . Weiqi Yan, Wei Ding, and Qi Dongxu. 2000. Image sharing based on Chinese remainder theorem. J. North China Univ. of Tech 12, 1 (2000), 6\u20139.","journal-title":"J. North China Univ. of Tech"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2018.07.015"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.3001735"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68542-7_36"},{"key":"e_1_2_1_34_1","first-page":"1","article-title":"out of  \t\t\t\t\t\t \t\t\t\t\t\t\t \t\t\t\t\t\t\t\t \t\t\t\t\t\t\t \t\t\t\t\t\t \t\t\t\t\t region-based progressive visual cryptography","volume":"29","author":"Yang C.","year":"2019","unstructured":"C. Yang , C. Wu , and Y. Lin . 2019 . out of region-based progressive visual cryptography . IEEE Trans. Circ. Syst. Vid. Technol. 29 , 1 (Jan. 2019), 252\u2013262. DOI:https:\/\/doi.org\/10.1109\/TCSVT.2017.2771255 10.1109\/TCSVT.2017.2771255 C. Yang, C. Wu, and Y. Lin. 2019. out of region-based progressive visual cryptography. IEEE Trans. Circ. Syst. Vid. Technol. 29, 1 (Jan. 2019), 252\u2013262. DOI:https:\/\/doi.org\/10.1109\/TCSVT.2017.2771255","journal-title":"IEEE Trans. Circ. Syst. Vid. Technol."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2010.04.003"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2838334"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.875249"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3151-8"},{"key":"e_1_2_1_39_1","volume-title":"Commun., Applic. 16, 2","author":"Zhou Zhili","year":"2020","unstructured":"Zhili Zhou , Q. M. Jonathan Wu , Yimin Yang , and Xingming Sun . 2020. Region-level visual consistency verification for large-scale partial-duplicate image search. ACM Trans. Multimedia Comput ., Commun., Applic. 16, 2 ( 2020 ). Zhili Zhou, Q. M. Jonathan Wu, Yimin Yang, and Xingming Sun. 2020. Region-level visual consistency verification for large-scale partial-duplicate image search. ACM Trans. Multimedia Comput., Commun., Applic. 16, 2 (2020)."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2811722"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3419750","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3419750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:32:03Z","timestamp":1750195923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3419750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,28]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2,28]]}},"alternative-id":["10.1145\/3419750"],"URL":"https:\/\/doi.org\/10.1145\/3419750","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"value":"1551-6857","type":"print"},{"value":"1551-6865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,28]]},"assertion":[{"value":"2020-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}