{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:38Z","timestamp":1772283698923,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(00)00207-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:13:43Z","timestamp":1027606423000},"page":"285-298","source":"Crossref","is-referenced-by-count":28,"title":["Secret-sharing with a class of ternary codes"],"prefix":"10.1016","volume":"246","author":[{"given":"Cunsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R","family":"Kohel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00207-3_BIB1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1026421315292","article-title":"How to build robust shared control systems","volume":"15","author":"Anderson","year":"1998","journal-title":"Designs Codes Cryptogr."},{"key":"10.1016\/S0304-3975(00)00207-3_BIB2","series-title":"Designs and their Codes","author":"Assmus","year":"1992"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB3","first-page":"313","article-title":"Safeguarding cryptographic keys","author":"Blakley","year":"1979","journal-title":"Proc. NCC AFIPS"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB4","first-page":"468","article-title":"Some ideal secret sharing schemes","volume":"vol. 434","author":"Brickell","year":"1990"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB5","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/18.817529","article-title":"Elementary 2-group character codes","volume":"IT-46","author":"Ding","year":"2000","journal-title":"IEEE Trans Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB6","series-title":"Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography","author":"Ding","year":"1996"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB7","first-page":"644","article-title":"On secret sharing systems","volume":"IT-29","author":"Karnin","year":"1983","journal-title":"IEEE Trans Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB8","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1978"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB9","unstructured":"J.L. Massey, Minimal codewords and secret sharing, Proc. 6th Joint Swedish\u2013Russian Workshop on Information Theory, M\u00f6lle, Sweden, August 22\u201327, 1993, pp. 276\u2013279."},{"key":"10.1016\/S0304-3975(00)00207-3_BIB10","first-page":"33","article-title":"Some applications of coding theory in cryptography","author":"Massey","year":"1995"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","article-title":"On sharing secrets and Reed\u2013Solomon codes","volume":"24","author":"McEliece","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB12","first-page":"67","article-title":"The access structure of some secret sharing schemes","volume":"vol. 1172","author":"Renvall","year":"1996"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB13","series-title":"A Course in Arithmetic, Graduate Texts in Mathematics, vol. 7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9884-4","author":"Serre","year":"1973"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB14","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(00)00207-3_BIB15","first-page":"23","article-title":"A linear construction of perfect secret sharing schemes","volume":"vol. 950","author":"van Dijk","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T14:23:46Z","timestamp":1556461426000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397500002073"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00207-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}