{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:45:42Z","timestamp":1742957142853,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811580604"},{"type":"electronic","value":"9789811580611"}],"license":[{"start":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T00:00:00Z","timestamp":1607644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T00:00:00Z","timestamp":1607644800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-15-8061-1_15","type":"book-chapter","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T20:08:45Z","timestamp":1607630925000},"page":"179-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear Secret Sharing Schemes with Finer Access Structure"],"prefix":"10.1007","author":[{"given":"Sanyam","family":"Mehta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7082-9568","authenticated-orcid":false,"given":"Vishal","family":"Saraswat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,11]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01202040","volume":"6","author":"A Beimel","year":"1996","unstructured":"Beimel A, G\u00e1l A, Paterson M (1996) Lower bounds for monotone span programs. Comput Complex 6(1):29\u201345","journal-title":"Comput Complex"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Benaloh J, Leichter J (1990) Generalized secret sharing and monotone functions. In: CRYPTO. Springer, pp 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bioglio V, Gabry F, Land I (2015) Optimizing MDS codes for caching at the edge. In: global communications conference (GLOBECOM). IEEE, pp.\u00a01\u20136","DOI":"10.1109\/GLOCOM.2015.7417697"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blakley G (1979). Safeguarding cryptographic keys. In: AFIPS. AFIPS Press, pp 313\u2013317","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1018014013461","volume":"9","author":"M De Boer","year":"1996","unstructured":"De Boer M (1996) Almost MDS codes. Des Codes Crypt 9(2):143\u2013155","journal-title":"Des Codes Crypt"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dodunekova R, Dodunekov S, Kl\u00f8ve T (1997) Almost-MDS and near-MDS codes for error detection. IEEE Trans Inf Theor 43(1):285\u2013289","DOI":"10.1109\/18.567708"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10623-008-9265-8","volume":"52","author":"L Harn","year":"2009","unstructured":"Harn L, Lin C (2009) Detection and identification of cheaters in $$(t, n)$$ secret sharing scheme. Des Codes Crypt 52(1):15\u201324","journal-title":"Des Codes Crypt"},{"key":"15_CR8","unstructured":"Huffman WC, Pless V (2010) Fundamentals of error-correcting codes. Cambridge University Press"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Ito M, Saito A, Nishizeki T (1989) Secret sharing scheme realizing general access structure. Electron Commun Jpn (Part III: Fundam Electron Sci) 72(9):56\u201364","DOI":"10.1002\/ecjc.4430720906"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Mehta S, Saraswat, V, Sen S (2019) Secret sharing using near-MDS codes. In: Codes, Cryptology, and information security (C2SI). LNCS, vol 11445. Springer (2019), pp 195\u2013214","DOI":"10.1007\/978-3-030-16458-4_12"},{"key":"15_CR11","unstructured":"Pieprzyk J, Zhang XM (2002) Ideal threshold schemes from MDS codes. In: ICISC. vol\u00a02002, Springer (2002), pp 253\u2013263"},{"key":"15_CR12","unstructured":"Roman S (1992) Coding and information theory, graduate texts in mathematics, vol 134. Springer"},{"issue":"11","key":"15_CR13","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":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D Stinson","year":"1992","unstructured":"Stinson D (1992) An explication of secret sharing schemes. Des Codes Crypt 2(4):357\u2013390","journal-title":"Des Codes Crypt"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Viswanath G, Rajan BS (2001) Matrix characterization of generalized Hamming weights. In: IEEE international symposium on information theory. IEEE, p\u00a061","DOI":"10.1109\/ISIT.2001.935924"},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"3738","DOI":"10.1109\/TIT.2011.2134170","volume":"57","author":"Y Wu","year":"2011","unstructured":"Wu Y (2011) A construction of systematic MDS codes with minimum repair bandwidth. IEEE Trans Inf Theory 57(6):3738\u20133741","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Sixth International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-8061-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T20:13:34Z","timestamp":1607631214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-8061-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,11]]},"ISBN":["9789811580604","9789811580611"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-8061-1_15","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020,12,11]]},"assertion":[{"value":"11 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}