{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:33:49Z","timestamp":1773214429737,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"39","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-024-19749-w","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T07:02:33Z","timestamp":1719903753000},"page":"86757-86790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A framework for counting based secret sharing scheme for images"],"prefix":"10.1007","volume":"83","author":[{"given":"Bhawana","family":"Parihar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maroti","family":"Deshmukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjun Singh","family":"Rawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"issue":"11","key":"19749_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"},{"issue":"1","key":"19749_CR2","first-page":"612","volume":"22","author":"Blakley GR (1979) Safeguarding cryptographic keys. In proceedings of the AFIPS 1979 national computer conference, pp 313\u2013317. Arlington. [2] Shamir A","year":"1979","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. In proceedings of the AFIPS 1979 national computer conference, pp 313\u2013317. Arlington. [2] Shamir A (1979) How to share a secret. Commun ACM 22(1):612\u2013613","journal-title":"Commun ACM"},{"key":"19749_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-62494-5_18","volume":"1189","author":"M Naor","year":"1996","unstructured":"Naor M, Shamir A (1996) Visual Cryptography II: Improving the Contrast Via the Cover Base. In Security protocols workshop 1189:197\u2013202","journal-title":"In Security protocols workshop"},{"issue":"10","key":"19749_CR4","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1016\/j.patcog.2006.11.018","volume":"40","author":"D Wang","year":"2007","unstructured":"Wang D et al (2007) Two secret sharing schemes based on Boolean operations. Pattern Recogn 40(10):2776\u20132785","journal-title":"Pattern Recogn"},{"issue":"2","key":"19749_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1142\/S0218001409007090","volume":"23","author":"K-Y Chao","year":"2009","unstructured":"Chao K-Y, Lin J-C (2009) Secret image sharing: A Boolean-operations-based approach combining benefits of polynomial-based and fast approaches. Int J Pattern Recogn Artif Intell 23(2):263\u2013285","journal-title":"Int J Pattern Recogn Artif Intell"},{"key":"19749_CR6","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1002\/sec.769","volume":"7","author":"S Kumar","year":"2014","unstructured":"Kumar S, Sharma RK (2014) Threshold visual secret sharing based on Boolean operations. Secur Commun Netw Secur Comm Netw 7:653\u2013664","journal-title":"Secur Commun Netw Secur Comm Netw"},{"key":"19749_CR7","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, Wu W-J (2014) A secure Boolean-based multi-secret image sharing scheme. J Syst Softw 92:107\u2013114","journal-title":"J Syst Softw"},{"key":"19749_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jss.2015.01.031","volume":"216","author":"C-N Yang","year":"2016","unstructured":"Yang C-N, Chen C-H, Cai S-R (2016) Enhanced Boolean-based multi secret image sharing scheme. J Syst Softw 216:22\u201334","journal-title":"J Syst Softw"},{"key":"19749_CR9","first-page":"677","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. Twelfth Int Multi-Conference Inf Process 89:677\u2013683","journal-title":"Twelfth Int Multi-Conference Inf Process"},{"key":"19749_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.image.2018.04.002","volume":"65","author":"P Li","year":"2018","unstructured":"Li P, Liu Z, Yang CN (2018) A construction method of (t, k, n) - essential secret image sharing scheme. Signal Process Image Commun 65:210\u2013220","journal-title":"Signal Process Image Commun"},{"issue":"3","key":"19749_CR11","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":"19749_CR12","first-page":"16","volume":"47","author":"S Kabirirad","year":"2019","unstructured":"Kabirirad S, Eslami Z (2019) Improvement of (n, n)-multi-secret image sharing schemes based on Boolean operations. J Inf Secur Appl 47:16\u201327","journal-title":"J Inf Secur Appl"},{"issue":"17","key":"19749_CR13","doi-asserted-by":"publisher","first-page":"12183","DOI":"10.1007\/s11042-019-08454-8","volume":"79","author":"M Gupta","year":"2020","unstructured":"Gupta M, Gupta M, Deshmukh M (2020) Single secret image sharing scheme using neural cryptography. Multimed Tools App 79(17):12183\u201312204","journal-title":"Multimed Tools App"},{"key":"19749_CR14","doi-asserted-by":"crossref","unstructured":"Rawat AS, Deshmukh M, Singh M (2023) Meaningful Shares based Single Secret Sharing Scheme using Chinese Remainder Theorem and XOR Operation. 10th International conference on signal processing and integrated networks (SPIN), pp 597\u2013602. IEEE","DOI":"10.1109\/SPIN57001.2023.10116100"},{"key":"19749_CR15","doi-asserted-by":"crossref","unstructured":"Rawat AS, Deshmukh M, Singh M (2023) QR Shares based Secret Sharing Scheme using DWT, Random Permutation and Arithmetic Modulo Operation for QR Secret. 10th International conference on signal processing and integrated networks (SPIN), pp 772\u2013777. IEEE","DOI":"10.1109\/SPIN57001.2023.10116359"},{"key":"19749_CR16","volume":"55","author":"A Rawat","year":"2020","unstructured":"Rawat A, Deshmukh M (2020) Tree and elliptic curve based efficient and secure group key agreement protocol. J Inf Secur App 55:102599","journal-title":"J Inf Secur App"},{"key":"19749_CR17","doi-asserted-by":"publisher","first-page":"5591","DOI":"10.1007\/s11042-017-5293-6","volume":"78","author":"A Gutub","year":"2019","unstructured":"Gutub A, Al-Juaid N, Khan E (2019) Counting-based secret sharing technique for multimedia applications. Multimed Tools App 78:5591\u20135619","journal-title":"Multimed Tools App"},{"issue":"9","key":"19749_CR18","first-page":"1108","volume":"33","author":"AA-A Gutub","year":"2021","unstructured":"Gutub AA-A, Alaseri KA (2021) Refining Arabic text stego-techniques for shares memorization of counting-based secret sharing. J King Saud Univ Comput Inf Sci 33(9):1108\u20131120","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"11\u201312","key":"19749_CR19","doi-asserted-by":"publisher","first-page":"7951","DOI":"10.1007\/s11042-019-08427-x","volume":"79","author":"A Gutub","year":"2020","unstructured":"Gutub A, Al-Ghamdi M (2020) Hiding shares by multimedia image steganography for optimized counting-based secret sharing. Multimed Tools App 79(11\u201312):7951\u20137985","journal-title":"Multimed Tools App"},{"key":"19749_CR20","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/s11042-020-09720-w","volume":"80","author":"T AlKhodaidi","year":"2021","unstructured":"AlKhodaidi T, Gutub A (2021) Refining image steganography distribution for higher security multimedia counting-based secret-sharing. Multimed Tools App 80:1143\u20131173","journal-title":"Multimed Tools App"},{"issue":"2","key":"19749_CR21","doi-asserted-by":"publisher","first-page":"2585","DOI":"10.1007\/s13369-021-06200-7","volume":"47","author":"E Almehmadi","year":"2022","unstructured":"Almehmadi E, Gutub A (2022) Novel arabic e-text watermarking supporting partial dishonesty based on counting-based secret sharing. Arab J Sci Eng 47(2):2585\u20132609","journal-title":"Arab J Sci Eng"},{"issue":"9","key":"19749_CR22","first-page":"6909","volume":"34","author":"F Al-Shaarani","year":"2022","unstructured":"Al-Shaarani F, Gutub A (2022) Securing matrix counting-based secret-sharing involving crypto steganography. J King Saud Univ Comput Inf Sci 34(9):6909\u20136924","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"2","key":"19749_CR23","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1007\/s13369-021-06165-7","volume":"47","author":"F Al-Shaarani","year":"2022","unstructured":"Al-Shaarani F, Gutub A (2022) Increasing participants using counting-based secret sharing via involving matrices and practical steganography. Arab J Sci Eng 47(2):2455\u20132477","journal-title":"Arab J Sci Eng"},{"issue":"2","key":"19749_CR24","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1049\/cit2.12093","volume":"8","author":"A Gutub","year":"2023","unstructured":"Gutub A (2023) Boosting image watermarking authenticity spreading secrecy from counting-based secret-sharing. CAAI Trans Intell Tech 8(2):440\u2013452","journal-title":"CAAI Trans Intell Tech"},{"issue":"5","key":"19749_CR25","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1016\/j.jss.2012.12.022","volume":"86","author":"T-H Chen","year":"2013","unstructured":"Chen T-H et al (2013) Quality-adaptive visual secret sharing by random grids. J Syst Softw 86(5):1267\u20131274","journal-title":"J Syst Softw"},{"issue":"9","key":"19749_CR26","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1016\/j.patcog.2008.11.015","volume":"42","author":"T-H Chen","year":"2009","unstructured":"Chen T-H, Tsao K-H (2009) Visual secret sharing by random grids revisited. Pattern Recogn 42(9):2203\u20132217","journal-title":"Pattern Recogn"},{"key":"19749_CR27","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. IEEE 30th International conference on advanced information networking and applications, pp 690\u2013697","DOI":"10.1109\/AINA.2016.56"},{"issue":"3","key":"19749_CR28","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.jss.2004.07.250","volume":"76","author":"J-B Feng","year":"2005","unstructured":"Feng J-B et al (2005) A new multi-secret images sharing scheme using Largrange\u2019s interpolation. J Syst Softw 76(3):327\u2013339","journal-title":"J Syst Softw"},{"issue":"12","key":"19749_CR29","doi-asserted-by":"publisher","first-page":"1594","DOI":"10.1016\/j.patrec.2012.04.010","volume":"33","author":"C Guo","year":"2012","unstructured":"Guo C, Chang C-C, Qin C (2012) A multi-threshold secret image sharing scheme based on MSP. Pattern Recogn Lett 33(12):1594\u20131600","journal-title":"Pattern Recogn Lett"},{"issue":"18","key":"19749_CR30","doi-asserted-by":"publisher","first-page":"11577","DOI":"10.1007\/s11042-015-2885-x","volume":"75","author":"C Guo","year":"2016","unstructured":"Guo C et al (2016) A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem. Multimed Tools App 75(18):11577\u201311594","journal-title":"Multimed Tools App"},{"key":"19749_CR31","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11277-023-10315-5","volume":"130","author":"D Pande","year":"2023","unstructured":"Pande D, Rawat AS, Deshmukh M, Singh M (2023) Single Secret Sharing Scheme Using Chinese Remainder Theorem, Modified Shamir\u2019s Scheme and XOR Operation. Wirel Pers Commun 130:957\u2013985","journal-title":"Wirel Pers Commun"},{"key":"19749_CR32","doi-asserted-by":"crossref","unstructured":"Parihar B, Rawat AS, Deshmukh M (2024) A survey on counting-based secret sharing schemes for resource-constrained environments: techniques, security, challenges, and future directions. J Supercomput 1\u201355","DOI":"10.1007\/s11227-024-06130-9"},{"issue":"10","key":"19749_CR33","doi-asserted-by":"publisher","first-page":"12157","DOI":"10.1007\/s11227-021-03747-y","volume":"77","author":"K Bisht","year":"2021","unstructured":"Bisht K, Deshmukh M (2021) A novel approach for multilevel multi-secret image sharing scheme. J Supercomput 77(10):12157\u201312191","journal-title":"J Supercomput"},{"key":"19749_CR34","doi-asserted-by":"crossref","unstructured":"Rawat AS, Deshmukh M, Singh M (2023) A novel multi secret image sharing scheme for different dimension secrets. Multimed Tools App 1\u201337","DOI":"10.1007\/s11042-023-14609-5"},{"issue":"17","key":"19749_CR35","doi-asserted-by":"publisher","first-page":"19138","DOI":"10.1007\/s11227-023-05396-9","volume":"79","author":"AS Rawat","year":"2023","unstructured":"Rawat AS, Deshmukh M, Singh M (2023) Natural share-based lightweight (n, n) single secret image sharing scheme using LSB stuffing for medical images. J Supercomput 79(17):19138\u201319167","journal-title":"J Supercomput"},{"key":"19749_CR36","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.procs.2023.12.071","volume":"230","author":"B Parihar","year":"2023","unstructured":"Parihar B, Deshmukh M, Rawat AS (2023) Efficient Single Secret Image Sharing in Resource-Constrained Environment using Counting-Based Secret Sharing over Cloud. Procedia Comput Sci 230:158\u2013167","journal-title":"Procedia Comput Sci"},{"key":"19749_CR37","doi-asserted-by":"crossref","unstructured":"Al-Ghamdi M, Al-Ghamdi M, Gutub A (2019) Security enhancement of shares generation process for multimedia counting-based secret-sharing technique. Multimed Tools App 16283\u201316310","DOI":"10.1007\/s11042-018-6977-2"},{"issue":"4","key":"19749_CR38","doi-asserted-by":"publisher","first-page":"87","DOI":"10.20967\/jcscm.2018.04.006","volume":"8","author":"A Al-Qurashi","year":"2018","unstructured":"Al-Qurashi A, Gutub A (2018) Reliable Secret Key Generation For Counting-Based Secret Sharing. J Comput Sci Comput Math 8(4):87\u2013101","journal-title":"J Comput Sci Comput Math"},{"key":"19749_CR39","doi-asserted-by":"crossref","unstructured":"Gutub A, Al-Ghamdi M (2019) Image based steganography to facilitate improving counting-based secret sharing. 3D Research 10:1\u201336","DOI":"10.1007\/s13319-019-0216-0"},{"key":"19749_CR40","doi-asserted-by":"crossref","unstructured":"Li Q, 1Audio Analysis Lab, Department of Mathematical Science (2019) Privacy-Preserving Distributed Average Consensus based on Additive Secret Sharing. 27th European Signal Processing Conference, pp 1\u20135","DOI":"10.23919\/EUSIPCO.2019.8902577"},{"issue":"1","key":"19749_CR41","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TCSS.2021.3102591","volume":"9","author":"H Gao","year":"2021","unstructured":"Gao H et al (2021) The deep features and attention mechanism-based method to dish healthcare under social iot systems: an empirical study with a hand-deep local\u2013global net. IEEE Trans Comput Soc Syst 9(1):336\u2013347","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"4","key":"19749_CR42","doi-asserted-by":"publisher","first-page":"4826","DOI":"10.1109\/TNNLS.2022.3155486","volume":"35","author":"H Gao","year":"2022","unstructured":"Gao H et al (2022) A mutually supervised graph attention network for few-shot segmentation: the perspective of fully utilizing limited samples. IEEE Trans Neural Netw Learn Syst 35(4):4826\u20134838","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"19749_CR43","doi-asserted-by":"publisher","first-page":"2978","DOI":"10.1109\/TNSE.2022.3163144","volume":"10","author":"H Gao","year":"2022","unstructured":"Gao H et al (2022) Tsmae: a novel anomaly detection approach for internet of things time series data using memory-augmented autoencoder. IEEE Trans Netw Sci Eng 10(5):2978\u20132990","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"19749_CR44","unstructured":"diagrams.net. Available online: https:\/\/app.diagrams.net\/ Accessed 25 April 2024"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-19749-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-024-19749-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-19749-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T13:18:29Z","timestamp":1732022309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-024-19749-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":44,"journal-issue":{"issue":"39","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["19749"],"URL":"https:\/\/doi.org\/10.1007\/s11042-024-19749-w","relation":{},"ISSN":["1573-7721"],"issn-type":[{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"assertion":[{"value":"25 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The authors declare that there is no violation of ethical rules, this manuscript has not been copyrighted or published previously.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"There is no involvement of animals in studies. There is no involvement of human participants in studies.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}