{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:58Z","timestamp":1750309498923,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T00:00:00Z","timestamp":1739923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB3103100","2022YFE0116800"],"award-info":[{"award-number":["2022YFB3103100","2022YFE0116800"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972179","62102101"],"award-info":[{"award-number":["61972179","62102101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving","award":["2023B1212060036"],"award-info":[{"award-number":["2023B1212060036"]}]},{"name":"Doctoral Scientific Research Foundation of Guangdong Polytechnic Normal University","award":["2021SDKYA101"],"award-info":[{"award-number":["2021SDKYA101"]}]},{"name":"National Science and Technology Council","award":["112-2221-E-259-007-MY2"],"award-info":[{"award-number":["112-2221-E-259-007-MY2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"\n A systematic investigation of evolving visual cryptography scheme (EVCS) is carried out in this article. The evolving scheme, denoted as\n \n \\((k,\\infty)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n , differs from the\n \n \\((k,n)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n threshold in that it permits an arbitrary and perhaps unlimited number of participants. More importantly, the access structure can be updated dynamically by adding new users. First of all, a preliminary implementation strategy for the\n \n \\((2,\\infty)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n EVCS is introduced. Then, by employing the\n \n \\((2,2)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n VCS recursively with the\n \n \\((2,\\infty)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n EVCS, a\n \n \\((k,\\infty)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n EVCS is created. In order to enhance the performance, an improved scheme is constructed based on the multi-secret VCS (MVCS) and a series of EVCS schemes with thresholds of\n \n \\((1,\\infty)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n ,\n \n \\(\\cdots\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n ,\n \n \\((k-1,\\infty)\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n . Moreover, Boolean XOR operation is adopted for secret recovery to further improve the visual quality. To facilitate the XOR decryption, a novel access structure partition algorithm is presented. Additionally, the proposed partition method can successfully solve the security issue in existing multi-secret XOR-based VCS (MXVCS). By integrating the more secure MXVCS into the improved scheme, XOR decryption is provided. The two proposed methods are shown to be effective and advantageous through extensive experiments and comparisons.\n <\/jats:p>","DOI":"10.1145\/3708547","type":"journal-article","created":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T10:08:02Z","timestamp":1734170882000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["EVCS-DAS: Evolving Visual Cryptography Schemes for Dynamic Access Structures"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-2247","authenticated-orcid":false,"given":"Xiaotian","family":"Wu","sequence":"first","affiliation":[{"name":"Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1842-7487","authenticated-orcid":false,"given":"Xinjie","family":"Feng","sequence":"additional","affiliation":[{"name":"Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1716-877X","authenticated-orcid":false,"given":"Bing","family":"Chen","sequence":"additional","affiliation":[{"name":"Guangdong Polytechnic Normal University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3881-7329","authenticated-orcid":false,"given":"Ching-Nung","family":"Yang","sequence":"additional","affiliation":[{"name":"National Dong Hwa University, Shoufeng, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7467-1585","authenticated-orcid":false,"given":"Qing-Yu","family":"Peng","sequence":"additional","affiliation":[{"name":"Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7443-3285","authenticated-orcid":false,"given":"Weiqi","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Engineering, Computer and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,19]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056651"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.11.015"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2641378"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.01.019"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3298803"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2016.2631404"},{"issue":"6","key":"e_1_3_1_8_2","doi-asserted-by":"crossref","first-page":"4179","DOI":"10.1109\/TIT.2017.2779121","article-title":"How to Share a secret, infinitely","volume":"64","author":"Komargodski Ilan","year":"2017","unstructured":"Ilan Komargodski, Moni Naor, and Eylon Yogev. 2017. How to Share a secret, infinitely. IEEE Transactions on Information Theory 64, 6 (2017), 4179\u20134190.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2022.103513"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2994386"},{"issue":"3","key":"e_1_3_1_11_2","first-page":"1","article-title":"Contrast-enhanced color visual cryptography for (k, n)","volume":"18","author":"Liu Zuquan","year":"2022","unstructured":"Zuquan Liu, Guopu Zhu, Feng Ding, Xiangyang Luo, Sam Kwong, and Peng Li. 2022. Contrast-enhanced color visual cryptography for (k, n) Threshold schemes. ACM Transactions on Multimedia Computing, Communications and Applications 18, 3s (2022), 1\u201316.","journal-title":"Threshold schemes. ACM Transactions on Multimedia Computing, Communications and Applications"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3396520"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2021.116221"},{"issue":"1","key":"e_1_3_1_14_2","first-page":"1","article-title":"Visual cryptography","volume":"950","author":"Naor M.","year":"1995","unstructured":"M. Naor and A. Shamir. 1995. Visual cryptography. Lecture Notes in Computer Science 950, 1 (1995), 1\u201312.","journal-title":"Lecture Notes in Computer Science"},{"issue":"6","key":"e_1_3_1_15_2","first-page":"3042","article-title":"A secret JPEG image sharing method over GF ( \\(2^{M}\\) ) Galois fields","volume":"33","author":"Puteaux Pauline","year":"2023","unstructured":"Pauline Puteaux, F\u00e9lix Yriarte, and William Puech. 2023. A secret JPEG image sharing method over GF ( \\(2^{M}\\) ) Galois fields. IEEE Transactions on Circuits and Systems for Video Technology 33, 6 (2023), 3030\u20133042.","journal-title":"IEEE Transactions on Circuits and Systems for Video Technology"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2021.3091319"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0285-5"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2935618"},{"issue":"9","key":"e_1_3_1_20_2","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1109\/TCSVT.2017.2707923","article-title":"XOR-based visual cryptographic schemes with monotonously increasing and flawless reconstruction properties","volume":"28","author":"Shyu Shyong Jian","year":"2018","unstructured":"Shyong Jian Shyu. 2018. XOR-based visual cryptographic schemes with monotonously increasing and flawless reconstruction properties. IEEE Transactions on Circuits and Systems for Video Technology 28, 9 (2018), 2397\u20132401.","journal-title":"IEEE Transactions on Circuits and Systems for Video Technology"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/080722023"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.02.003"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2158096"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2250432"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3550275"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2281108"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2344436.2344438"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2022.3199047"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2023.3263101"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2023.3282573"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3271299"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3065794"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3572842"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11554-015-0540-4"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2020.3025527"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2003.12.011"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2013.2276708"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3270882"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3708547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:46Z","timestamp":1750295866000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,19]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3708547"],"URL":"https:\/\/doi.org\/10.1145\/3708547","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2025,2,19]]},"assertion":[{"value":"2024-04-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}