{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:16:34Z","timestamp":1770164194279,"version":"3.49.0"},"reference-count":29,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,1,9]]},"abstract":"<jats:p>\n                    Traditional (\n                    <jats:italic>k<\/jats:italic>\n                    ,\n                    <jats:italic>n<\/jats:italic>\n                    ) secret image sharing provides all-or-nothing decoding model and (\n                    <jats:italic>k<\/jats:italic>\n                    ,\n                    <jats:italic>n<\/jats:italic>\n                    ) scalable secret image sharing provides progress decoding model during image reconstruction. Both these two decoding models are significance in various applications. However, the security level for real applications would change due to the dynamical environment, only one single decoding model cannot satisfy the changeable security requirement. In this work, we construct scalable secret image sharing schemes that provides both all-or-nothing and progress decoding models to satisfy the dynamical secure requirement. Each participant in our schemes only needs to keep one initial-shadow. During image reconstruction, the dealer selects the decoding model according to current security requirement, if progress model is chosen, initial shadows can achieve image reconstruction in progress model without any modification; else if all-or-nothing model is chosen, the dealer does not need to resent new shadows to participants, the initial-shadows can be updated to satisfy all-or-nothing model efficiently.\n                  <\/jats:p>","DOI":"10.3233\/jifs-179396","type":"journal-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T14:55:05Z","timestamp":1569336905000},"page":"219-228","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":6,"title":["(\n                    <i>k<\/i>\n                    ,\n                    <i>n<\/i>\n                    ) scalable secret image sharing with multiple decoding options"],"prefix":"10.1177","volume":"38","author":[{"given":"Yan-Xiao","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, XI\u2019AN University of Technology, XI\u2019AN City, China"}]},{"given":"Ching-Nung","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, TaiWan"}]},{"given":"Qin-Dong","family":"Sun","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, TaiWan"}]},{"given":"Yi-Cheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, TaiWan"}]}],"member":"179","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-8493(02)00131-0"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"M.Naor and A.Shamir Visual cryptography Proc of EUROCRYPT1994 LNCS 950 1995 pp. 1\u201312.","DOI":"10.1007\/BFb0053419"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.09.021"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.06.021"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-019-7205-4"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2250432"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.099"},{"issue":"12","key":"e_1_3_2_9_2","article-title":"Load balancing and its challenges in cloud computing: A review paper","volume":"5","author":"Lal S.","year":"2017","unstructured":"S.Lal and Prof.S.Sharma, Load balancing and its challenges in cloud computing: A review paper, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE) 5(12) (2017).","journal-title":"International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE)"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2011.07.004"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2015.02.012"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2006.12.012"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.optcom.2009.12.077"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.05.008"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2038113"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/sec.930"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2018.04.002"},{"issue":"1","key":"e_1_3_2_18_2","article-title":"Enhanced secure mechanism for ARP poisoning and MITM attack","volume":"6","author":"Lakhanpal P.","year":"2018","unstructured":"P.Lakhanpal and Prof.D.Agrawal, Enhanced secure mechanism for ARP poisoning and MITM attack, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE) 6(1) (2018).","journal-title":"International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE)"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2015.12.004"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2014.11.003"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2017.06.011"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2011.2180952"},{"issue":"11","key":"e_1_3_2_23_2","article-title":"A novel approach for software defect prediction using learning algorithms","volume":"5","author":"Maheswari S.","year":"2017","unstructured":"S.Maheswari and K.Chitra, A novel approach for software defect prediction using learning algorithms, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE) 5(11) (2017).","journal-title":"International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE)"},{"key":"e_1_3_2_24_2","first-page":"449","article-title":"Region in region incrementing visual cryptography scheme","volume":"2012","author":"Yang C.N.","year":"2013","unstructured":"C.N.Yang, Y.C.Lin and C.C.Wu, Region in region incrementing visual cryptography scheme, Proc IWDW 2012, LNCS 7809 (2013), 449\u2013463.","journal-title":"Proc IWDW"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2018.05.004"},{"key":"e_1_3_2_26_2","first-page":"1","article-title":"Greyscale-images-oriented progressive secret sharing based on the linear congruence equation","volume":"2","author":"Liu L.T.","year":"2017","unstructured":"L.T.Liu, Y.L.Lu, X.H.Yan and H.X.Wan, Greyscale-images-oriented progressive secret sharing based on the linear congruence equation, Multimedia Tools and Applications 2 (2017), 1\u201328.","journal-title":"Multimedia Tools and Applications"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.09.027"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.06.014"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0165512"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2018.07.015"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179396","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179396","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T11:24:22Z","timestamp":1770117862000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,23]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1,9]]}},"alternative-id":["10.3233\/JIFS-179396"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179396","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,23]]}}}