{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:24:45Z","timestamp":1760955885464},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T00:00:00Z","timestamp":1536364800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10115-018-1268-9","type":"journal-article","created":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T10:50:11Z","timestamp":1536403811000},"page":"1377-1396","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Secret sharing scheme based on binary trees and Boolean operation"],"prefix":"10.1007","volume":"60","author":[{"given":"Maroti","family":"Deshmukh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeta","family":"Nain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mushtaq","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"issue":"11","key":"1268_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":"48","key":"1268_CR2","first-page":"313","volume":"1979","author":"GR Blakley","year":"1979","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. Proc Natl Comput Conf 1979(48):313\u2013317","journal-title":"Proc Natl Comput Conf"},{"issue":"5","key":"1268_CR3","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, Lee Y-S, Huang W-L, Juan JS-T, Chen Y-Y, Li M-J (2013) Quality-adaptive visual secret sharing by random grids. J Syst Softw 86(5):1267\u20131274","journal-title":"J Syst Softw"},{"issue":"10","key":"1268_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, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on Boolean operations. Pattern Recognit 40(10):2776\u20132785","journal-title":"Pattern Recognit"},{"key":"#cr-split#-1268_CR5.1","doi-asserted-by":"crossref","unstructured":"Naor M, Shamir A (1995) Visual cryptography. In: De Santis","DOI":"10.1007\/BFb0053419"},{"key":"#cr-split#-1268_CR5.2","unstructured":"(ed) Advances in cryptology-EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, pp 1-12"},{"issue":"6","key":"1268_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1364\/OL.12.000377","volume":"12","author":"O Kafri","year":"1987","unstructured":"Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12(6):377\u2013379","journal-title":"Opt Lett"},{"issue":"9","key":"1268_CR7","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 Recognit 42(9):2203\u20132217","journal-title":"Pattern Recognit"},{"key":"1268_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.displa.2015.10.005","volume":"41","author":"T Tuncer","year":"2016","unstructured":"Tuncer T, Avci E (2016) A reversible data hiding algorithm based on probabilistic DNA-XOR secret sharing scheme for color images. Displays 41:1\u20138","journal-title":"Displays"},{"key":"1268_CR9","doi-asserted-by":"crossref","unstructured":"Jarecki S, Kiayias A, Krawczyk H, Xu J (2016) Highly-efficient and composable password-protected secret sharing (or: how to protect your bitcoin wallet online). In: 2016 IEEE European symposium on security and privacy (EuroS&P). IEEE, pp 276\u2013291","DOI":"10.1109\/EuroSP.2016.30"},{"key":"1268_CR10","doi-asserted-by":"crossref","unstructured":"Beimel A (2011) Secret-sharing schemes: a survey. In: International conference on coding and cryptology. Springer, pp 11\u201346","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"1268_CR11","doi-asserted-by":"crossref","unstructured":"Karchmer M, Wigderson A (1993) On span programs. In: Proceedings of the eighth annual structure in complexity theory conference, 1993. IEEE, pp 102\u2013111","DOI":"10.1109\/SCT.1993.336536"},{"key":"1268_CR12","unstructured":"Csirmaz L, Tardos G (2009) Secret sharing on trees: problem solved"},{"issue":"7","key":"1268_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0898-1221(96)00022-3","volume":"31","author":"H-M Sun","year":"1996","unstructured":"Sun H-M, Shieh S-P (1996) An efficient construction of perfect secret sharing schemes for graph-based structures. Comput Math Appl 31(7):129\u2013135","journal-title":"Comput Math Appl"},{"issue":"5","key":"1268_CR14","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"},{"key":"1268_CR15","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.sigpro.2013.06.003","volume":"94","author":"T Guo","year":"2014","unstructured":"Guo T, Liu F, ChuanKun W (2014) k Out of k extended visual cryptography scheme by random grids. Signal Process 94:90\u2013101","journal-title":"Signal Process"},{"issue":"3","key":"1268_CR16","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.patcog.2006.02.025","volume":"40","author":"SJ Shyu","year":"2007","unstructured":"Shyu SJ (2007) Image encryption by random grids. Pattern Recognit 40(3):1014\u20131031","journal-title":"Pattern Recognit"},{"issue":"21","key":"1268_CR17","doi-asserted-by":"publisher","first-page":"4242","DOI":"10.1016\/j.optcom.2010.06.042","volume":"283","author":"R-Z Wang","year":"2010","unstructured":"Wang R-Z, Lan Y-C, Lee Y-K, Huang S-Y, Shyu S-J, Chia T-L (2010) Incrementing visual cryptography using random grids. Opt Commun 283(21):4242\u20134249","journal-title":"Opt Commun"},{"issue":"7","key":"1268_CR18","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.jss.2011.02.023","volume":"84","author":"T-H Chen","year":"2011","unstructured":"Chen T-H, Tsao K-H (2011) Threshold visual secret sharing by random grids. J Syst Softw 84(7):1197\u20131208","journal-title":"J Syst Softw"},{"issue":"1","key":"1268_CR19","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. Signal Process 91(1):90\u201397","journal-title":"Signal Process"},{"key":"1268_CR20","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"},{"key":"1268_CR21","doi-asserted-by":"publisher","first-page":"1","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. Multimed Tools Appl 77:1\u201319","journal-title":"Multimed Tools Appl"},{"key":"1268_CR22","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"},{"key":"1268_CR23","doi-asserted-by":"crossref","unstructured":"Deshmukh M, Nain N, Ahmed M (2016) A novel approach of an (n, n) multi secret image sharing scheme using additive modulo. In: International conference on computer vision and image processing","DOI":"10.1007\/978-981-10-2104-6_14"},{"key":"1268_CR24","doi-asserted-by":"crossref","unstructured":"Deshmukh M, Nain N, Ahmed M (2016) Enhanced modulo based multi secret image sharing scheme. In: Ray I, Gaur M, Conti M, Sanghi D, Kamakoti V (eds) Information systems security. ICISS 2016. Lecture Notes in Computer Science, vol 10063. Springer, Cham, pp 212\u2013224","DOI":"10.1007\/978-3-319-49806-5_11"},{"key":"#cr-split#-1268_CR25.1","unstructured":"Mignotte M (1982) How to share a secret. In: Beth T"},{"key":"#cr-split#-1268_CR25.2","unstructured":"(ed) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, pp 371-375"},{"issue":"2","key":"1268_CR26","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":"1268_CR27","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":"1268_CR28","first-page":"31","volume":"1","author":"Wu Yue","year":"2011","unstructured":"Yue Wu, Noonan Joseph P, Sos Agaian (2011) NPCR and UACI randomness tests for image encryption. Cyber J Multidiscip J Sci Technol J Sel Areas Telecommun (JSAT) 1:31\u201338","journal-title":"Cyber J Multidiscip J Sci Technol J Sel Areas Telecommun (JSAT)"},{"issue":"3","key":"1268_CR29","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, Hsien-Chu W, Tsai C-S, Chu Y-P (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":"1268_CR30","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 Recognit Lett 33(12):1594\u20131600","journal-title":"Pattern Recognit Lett"},{"key":"1268_CR31","first-page":"1","volume":"75","author":"C Guo","year":"2015","unstructured":"Guo C, Zhang H, Song Q, Li M (2015) A multi-threshold secret image sharing scheme based on the generalized chinese reminder theorem. Multimed Tools Appl 75:1\u201318","journal-title":"Multimed Tools Appl"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1268-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1268-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1268-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T19:11:33Z","timestamp":1567883493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1268-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,8]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1268"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1268-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,8]]},"assertion":[{"value":"28 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}