{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:50:59Z","timestamp":1764132659303},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572206"},{"type":"electronic","value":"9783540479765"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57220-1_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:22:28Z","timestamp":1330240948000},"page":"67-79","source":"Crossref","is-referenced-by-count":40,"title":["A construction of practical secret sharing schemes using linear block codes"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bertilsson","sequence":"first","affiliation":[]},{"given":"Ingemar","family":"Ingemarsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"7_CR1","unstructured":"F.J. MacWilliams, N. J. A. Sloane, The Theory of ErrorCorrecting Codes, North-Holland, First Edition 1977"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to Share a Secret, Comm. ACM, Vol.22, pp612, Nov 1979","journal-title":"Comm. ACM"},{"key":"7_CR3","first-page":"313","volume":"48","author":"G. R. Blakely","year":"1979","unstructured":"G. R. Blakely, Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Natl. Computer Conference, New York, Vol.48, pp 313\u2013317, June 1979","journal-title":"Proc. AFIPS 1979 Natl. Computer Conference, New York"},{"key":"7_CR4","unstructured":"G. Simmons Ed, Contemporary Cryptology, IEEE Press, 1992"},{"key":"7_CR5","unstructured":"G. Simmons, W. Jackson, K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Application (ICA) to appear 1991"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece, D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Comm. ACM, Vol.24, pp 583\u2013584, Sep 1981","journal-title":"Comm. ACM"},{"issue":"No1","key":"7_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E.D Karnin","year":"1983","unstructured":"E.D Karnin, J.W. Green, M.E. Hellman, On Secret Sharing Systems, IEEE Trans. Information Th., Vol. IT-29, No 1, pp. 35\u201341, Jan 1983","journal-title":"IEEE Trans. Information Th."},{"key":"7_CR8","unstructured":"K.M. Martin, Discrete Structures in the Theory of Secret Sharing, Doct. Thesis, Royal Holloway and Bedford New College, University of London, 1991"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 AUSCRYPT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57220-1_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:48Z","timestamp":1619557248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57220-1_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572206","9783540479765"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-57220-1_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}