{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:51:50Z","timestamp":1762210310252,"version":"3.41.2"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1023\/a:1027380522085","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T17:46:39Z","timestamp":1068399999000},"page":"287-303","source":"Crossref","is-referenced-by-count":2,"title":["A Construction for Multisecret Threshold Schemes"],"prefix":"10.1007","volume":"9","author":[{"given":"Wen-Ai","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith M.","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine M.","family":"O'Keefe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"113938_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-39757-4_22","volume":"209","author":"R. Blom","year":"1984","unstructured":"R. Blom, An Optimal class of symmetric key generation systems. Advances in Cryptology-Eurocrypt '84, Lecture Notes in Computer Science. Vol. 209 (1984) 335\u2013338.","journal-title":"Advances in Cryptology-Eurocrypt '84, Lecture Notes in Computer Science"},{"key":"113938_CR2","first-page":"471","volume":"740","author":"C. Hiundo","year":"1993","unstructured":"C. Hiundo, A. De Santis. A. Hemberg, S. Kutlen, U. Vaccaro. and M. Yung. Perfectly-secure key disuibution for dynamic conferences. Advances in Cryptology-Crypto '92, Lecture Notes in Computer Science, Vol. 740 (1993) 471\u2013486","journal-title":"Advances in Cryptology-Crypto '92, Lecture Notes in Computer Science"},{"key":"113938_CR3","unstructured":"J. W. P Hirschfeld: Projective geometries overfinirefieldr. Clarendon Press (1979)."},{"key":"113938_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W.-A. Jackson","year":"1994","unstructured":"W.-A. Jackson and K. M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Crypfogr Vol. 4 (1994) 83\u201395.","journal-title":"Des. Codes Crypfogr"},{"key":"113938_CR5","first-page":"126","volume":"773","author":"W.-A. Jackson","year":"1994","unstructured":"W.-A. Jackson, K. M. Martin. and C.M O'Keefe. Multisecret threshold schemes. Advances in Cryptology-Crypta '93. Lecm Notes in Computer Scicnce. Vol 773 (1994) 126\u2013135.","journal-title":"Advances in Cryptology-Crypta '93. Lecm Notes in Computer Scicnce"},{"key":"113938_CR6","unstructured":"R. Lid1 and H. Niederreiter: Finire Fields. Cambridge University Press, Cambridge (1983)."},{"key":"113938_CR7","first-page":"183","volume":"293","author":"T. Matsurnolo","year":"1987","unstructured":"T. Matsurnolo and H. Irnai. On the key predistribution system: A practical solution to the key predistribution problem. Advances in Cryptology: Crypto '87, Lecture Notes in Computer Science, Vol. 293 (1987) 183\u2013193.","journal-title":"Advances in Cryptology: Crypto '87, Lecture Notes in Computer Science"},{"key":"113938_CR8","unstructured":"G. J. Simmons. An introdunion to shared sem mdlor shared control scbernes and their application. Contrmpomly Cryptology: The Science of Information Integrity. EEE Press (1992)."},{"key":"113938_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson. An explication of secrrt sharing schemes. Des, Codos Clyptogr: Vol. 2 (1992) 357\u2013390.","journal-title":"Des, Codos Clyptogr"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027380522085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027380522085\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027380522085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:58:53Z","timestamp":1753761533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027380522085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["113938"],"URL":"https:\/\/doi.org\/10.1023\/a:1027380522085","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}