{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T14:21:18Z","timestamp":1780755678580,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T00:00:00Z","timestamp":1617667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T00:00:00Z","timestamp":1617667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s11227-021-03747-y","type":"journal-article","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T11:02:30Z","timestamp":1617706950000},"page":"12157-12191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A novel approach for multilevel multi-secret image sharing scheme"],"prefix":"10.1007","volume":"77","author":[{"given":"Kanchan","family":"Bisht","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maroti","family":"Deshmukh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"issue":"11","key":"3747_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"3747_CR2","doi-asserted-by":"crossref","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, Los Alamitos, CA, USA. IEEE Computer Society, p 313","DOI":"10.1109\/MARK.1979.8817296"},{"key":"3747_CR3","doi-asserted-by":"publisher","first-page":"75113","DOI":"10.1109\/ACCESS.2019.2921612","volume":"7","author":"L Li","year":"2019","unstructured":"Li L, Yuliang L, Yan X, Liu L, Tan L (2019) Lossless $$(k, n)$$-threshold image secret sharing based on the Chinese remainder theorem without auxiliary encryption. IEEE Access 7:75113\u201375121","journal-title":"IEEE Access"},{"key":"3747_CR4","doi-asserted-by":"publisher","first-page":"59278","DOI":"10.1109\/ACCESS.2019.2914515","volume":"7","author":"L Tan","year":"2019","unstructured":"Tan L, Yuliang L, Yan X, Liu L, Li L (2019) Weighted secret image sharing for a $$(k, n)$$ threshold based on the Chinese remainder theorem. IEEE Access 7:59278\u201359286","journal-title":"IEEE Access"},{"key":"3747_CR5","doi-asserted-by":"publisher","first-page":"107104","DOI":"10.1109\/ACCESS.2019.2929090","volume":"7","author":"D Chen","year":"2019","unstructured":"Chen D, Wei L, Xing W, Wang N (2019) An efficient verifiable threshold multi-secret sharing scheme with different stages. IEEE Access 7:107104\u2013107110","journal-title":"IEEE Access"},{"issue":"3","key":"3747_CR6","first-page":"749","volume":"34","author":"Zhang Ben-Hui","year":"2018","unstructured":"Ben-Hui Zhang, Yuan-Sheng Tang (2018) On the construction and analysis of verifiable multi-secret sharing based on non-homogeneous linear recursion. J Inf Sci Eng 34(3):749\u2013763","journal-title":"J Inf Sci Eng"},{"key":"3747_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.displa.2017.05.004","volume":"49","author":"H-C Chao","year":"2017","unstructured":"Chao H-C, Fan T-Y (2017) Xor-based progressive visual secret sharing using generalized random grids. Displays 49:6\u201315","journal-title":"Displays"},{"issue":"1","key":"3747_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJSN.2019.098906","volume":"14","author":"SP Kannojia","year":"2019","unstructured":"Kannojia SP, Kumar J (2019) Xor-based unexpanded meaningful visual secret sharing scheme. IJSN 14(1):1\u20139","journal-title":"IJSN"},{"key":"3747_CR9","doi-asserted-by":"crossref","unstructured":"Manupriya P, Sinha S, Kumar K (2017) Vsee: video secret sharing encryption technique. In 2017 Conference on Information and Communication Technology (CICT), IEEE, pp 1\u20136","DOI":"10.1109\/INFOCOMTECH.2017.8340639"},{"key":"3747_CR10","doi-asserted-by":"crossref","unstructured":"Deshmukh M, Nain N, Ahmed M (2016) An (n, n)-multi secret image sharing scheme using boolean xor and modular arithmetic. In: 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA), IEEE, pp 690\u2013697","DOI":"10.1109\/AINA.2016.56"},{"issue":"12","key":"3747_CR11","doi-asserted-by":"publisher","first-page":"16727","DOI":"10.1007\/s11042-018-7023-0","volume":"78","author":"T Duseja","year":"2019","unstructured":"Duseja T, Deshmukh M (2019) Image compression and encryption using Chinese remainder theorem. Multimedia Tools Appl 78(12):16727\u201316753","journal-title":"Multimedia Tools Appl"},{"issue":"3","key":"3747_CR12","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1007\/s10115-018-1268-9","volume":"60","author":"M Deshmukh","year":"2019","unstructured":"Deshmukh M, Nain N, Ahmed M (2019) Secret sharing scheme based on binary trees and Boolean operation. Knowl Inf Syst 60(3):1377\u20131396","journal-title":"Knowl Inf Syst"},{"key":"3747_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jvcir.2017.09.013","volume":"49","author":"M Deshmukh","year":"2017","unstructured":"Deshmukh M, Nain N, Ahmed M (2017) A novel approach for sharing multiple color images by employing Chinese remainder theorem. J Vis Commun Image Represent 49:291\u2013302","journal-title":"J Vis Commun Image Represent"},{"key":"3747_CR14","doi-asserted-by":"crossref","unstructured":"Gupta M, Gupta M, Deshmukh M (2020) Single secret image sharing scheme using neural cryptography. In: Multimedia Tools and Applications, pp 1\u201322","DOI":"10.1007\/s11042-019-08454-8"},{"key":"3747_CR15","doi-asserted-by":"crossref","unstructured":"Agarwal A, Deshmukh M (2021) 3-d plane based extended Shamir\u2019s secret sharing. Int J Inf Technol 1\u20134","DOI":"10.1007\/s41870-020-00607-5"},{"issue":"5","key":"3747_CR16","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/S0097-8493(02)00131-0","volume":"26","author":"C-C Thien","year":"2002","unstructured":"Thien C-C, Lin J-C (2002) Secret image sharing. Comput Graph 26(5):765\u2013770","journal-title":"Comput Graph"},{"issue":"7","key":"3747_CR17","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.jss.2006.11.022","volume":"80","author":"C-N Yang","year":"2007","unstructured":"Yang C-N, Chen T-S, Kun Hsuan Yu, Wang C-C (2007) Improvements of image sharing with steganography and authentication. J Syst Softw 80(7):1070\u20131076","journal-title":"J Syst Softw"},{"issue":"2","key":"3747_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.4018\/IJDCF.2018040107","volume":"10","author":"W Ding","year":"2018","unstructured":"Ding W, Liu K, Yan X, Liu L (2018) Polynomial-based secret image sharing scheme with fully lossless recovery. Int J Digit Crime Forensics (IJDCF) 10(2):120\u2013136","journal-title":"Int J Digit Crime Forensics (IJDCF)"},{"issue":"7","key":"3747_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.3390\/sym10070249","volume":"10","author":"X Zhou","year":"2018","unstructured":"Zhou X, Yuliang L, Yan X, Wang Y, Liu L (2018) Lossless and efficient polynomial-based secret image sharing with reduced shadow size. Symmetry 10(7):249","journal-title":"Symmetry"},{"key":"3747_CR20","doi-asserted-by":"publisher","first-page":"113216","DOI":"10.1109\/ACCESS.2019.2934999","volume":"7","author":"Q Gong","year":"2019","unstructured":"Gong Q, Wang Y, Yan X, Liu L (2019) Efficient and lossless polynomial-based secret image sharing for color images. IEEE Access 7:113216\u2013113222","journal-title":"IEEE Access"},{"key":"3747_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jss.2014.01.001","volume":"92","author":"C-C Chen","year":"2014","unstructured":"Chen C-C, Wei-Jie W (2014) A secure boolean-based multi-secret image sharing scheme. J Syst Softw 92:107\u2013114","journal-title":"J Syst Softw"},{"issue":"1","key":"3747_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s11042-016-4229-x","volume":"77","author":"M Deshmukh","year":"2018","unstructured":"Deshmukh M, Nain N, Ahmed M (2018) Efficient and secure multi secret sharing schemes based on Boolean XOR and arithmetic modulo. Multimedia Tools Appl 77(1):89\u2013107","journal-title":"Multimedia Tools Appl"},{"key":"3747_CR23","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.procs.2016.06.034","volume":"89","author":"M Rajput","year":"2016","unstructured":"Rajput M, Deshmukh M (2016) Secure (n, n+ 1)-multi secret image sharing scheme using additive modulo. Procedia Comput Sci 89:677\u2013683","journal-title":"Procedia Comput Sci"},{"key":"3747_CR24","first-page":"267","volume":"47","author":"YK Meghrajani","year":"2019","unstructured":"Meghrajani YK, Desai LS, Mazumdar HS (2019) Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share. J Inf Secur Appl 47:267\u2013274","journal-title":"J Inf Secur Appl"},{"key":"3747_CR25","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ins.2014.07.016","volume":"288","author":"K-S Lin","year":"2014","unstructured":"Lin K-S, Lin C-H, Chen T-H (2014) Distortionless visual multi-secret sharing based on random grid. Inf Sci 288:330\u2013346","journal-title":"Inf Sci"},{"issue":"3","key":"3747_CR26","first-page":"245","volume":"19","author":"S Salehi","year":"2014","unstructured":"Salehi S, Balafar MA (2014) Visual multi secret sharing by cylindrical random grid. J Inf Secur Appl 19(3):245\u2013255","journal-title":"J Inf Secur Appl"},{"issue":"5","key":"3747_CR27","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCE.2017.2716412","volume":"7","author":"M Rajput","year":"2018","unstructured":"Rajput M, Deshmukh M, Nain N, Ahmed M (2018) Securing data through steganography and secret sharing schemes: trapping and misleading potential attackers. IEEE Consum Electron Mag 7(5):40\u201345","journal-title":"IEEE Consum Electron Mag"},{"issue":"1","key":"3747_CR28","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.sigpro.2010.06.012","volume":"91","author":"T-H Chen","year":"2011","unstructured":"Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on boolean operations. Sig Process 91(1):90\u201397","journal-title":"Sig Process"},{"key":"3747_CR29","doi-asserted-by":"crossref","unstructured":"Ghodosi H, Pieprzyk J, Safavi-Naini R (1998) Secret sharing in multilevel and compartmented groups. In: Australasian Conference on Information Security and Privacy. Springer, pp 367\u2013378","DOI":"10.1007\/BFb0053748"},{"key":"3747_CR30","doi-asserted-by":"crossref","unstructured":"Simmons GJ (1988) How to (really) share a secret. In: Conference on the Theory and Application of Cryptography. Springer, pp 390\u2013448","DOI":"10.1007\/0-387-34799-2_30"},{"key":"3747_CR31","doi-asserted-by":"crossref","unstructured":"Lin CH, Lein YD (2009) Ideal perfect multilevel threshold secret sharing scheme. In: 2009 Fifth International Conference on Information Assurance and Security, IEEE, vol 2, pp 118\u2013121","DOI":"10.1109\/IAS.2009.279"},{"issue":"2","key":"3747_CR32","first-page":"2253","volume":"6","author":"PV Siva Kumar","year":"2014","unstructured":"Siva Kumar PV, Kurra RR, Tentu AN, Padmavathi G (2014) Multi-level secret sharing scheme for mobile ad-hoc networks. Int J Adv Netw Appl 6(2):2253","journal-title":"Int J Adv Netw Appl"},{"issue":"9","key":"3747_CR33","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ipl.2014.04.006","volume":"114","author":"L Harn","year":"2014","unstructured":"Harn L, Fuyou M (2014) Multilevel threshold secret sharing based on the Chinese remainder theorem. Inf Process Lett 114(9):504\u2013509","journal-title":"Inf Process Lett"},{"issue":"2","key":"3747_CR34","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth C, Bloom J (1983) A modular approach to key safeguarding. IEEE Trans Inf Theory 29(2):208\u2013210","journal-title":"IEEE Trans Inf Theory"},{"key":"3747_CR35","doi-asserted-by":"crossref","unstructured":"Mignotte M (1982) How to share a secret. In: Workshop on Cryptography. Springer, pp 371\u2013375","DOI":"10.1007\/3-540-39466-4_27"},{"key":"3747_CR36","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.dam.2019.05.011","volume":"268","author":"K Meng","year":"2019","unstructured":"Meng K, Miao F, Huang W, Xiong Y (2019) Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem. Discrete Appl Math 268:152\u2013163","journal-title":"Discrete Appl Math"},{"key":"3747_CR37","doi-asserted-by":"crossref","unstructured":"Singh N, Naidu TA, Basit A, Venkaiah VC (2016) Sequential secret sharing scheme based on Chinese remainder theorem. In: 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), IEEE, pp 1\u20136","DOI":"10.1109\/ICCIC.2016.7919678"},{"key":"3747_CR38","doi-asserted-by":"crossref","unstructured":"Basit A, Chaitanya Kumar N, Venkaiah VC, Abdul MS, Naidu TA, Naik W (2017) Multi-stage multi-secret sharing scheme for hierarchical access structure. In: 2017 International Conference on Computing, Communication and Automation (ICCCA), IEEE, pp 557\u2013563","DOI":"10.1109\/CCAA.2017.8229863"},{"key":"3747_CR39","doi-asserted-by":"crossref","unstructured":"Wang R-Z, Lee Y-K, Huang S-Y, Chia T-L (2007) Multilevel visual secret sharing. In: Second International Conference on Innovative Computing, Information and Control (ICICIC 2007), IEEE, pp 283\u2013283","DOI":"10.1109\/ICICIC.2007.401"},{"key":"3747_CR40","unstructured":"Koikara R, Paul A, Yoo K-Y (2016) Multilevel threshold secret image sharing based on the Chinese remainder theorem. In: Proceedings of the International Conference on Security and Management (SAM). The Steering Committee of The World Congress in Computer Science, Computer, p 318"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03747-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03747-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03747-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T09:29:49Z","timestamp":1631093389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03747-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,6]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["3747"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03747-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,6]]},"assertion":[{"value":"13 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}