{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:17:16Z","timestamp":1753888636225},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594093"},{"type":"electronic","value":"9783540492641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-49264-x_15","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T02:52:09Z","timestamp":1186455129000},"page":"183-193","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Secret Sharing Without a Mutually Trusted Authority"],"prefix":"10.1007","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\u2019Keefe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Adv. in Cryptology-CRYPTO\u201988, Lecture Notes in Comput. Sci, 403:27\u201335, 1990.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"15_CR2","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48:313\u2013317, 1979.","journal-title":"Proceedings of AFIPS 1979 National Computer Conference"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"E. F. Brickell","year":"1992","unstructured":"E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology, 5:153\u2013166, 1992.","journal-title":"J. Cryptology"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. M. Capocelli","year":"1993","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. J. Cryptology, 6:157\u2013167, 1993.","journal-title":"J. Cryptology"},{"key":"15_CR5","volume-title":"Information theory and reliable communication","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager. Information theory and reliable communication. John Wiley and Sons, New York, 1968."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. Adv. in Cryptology \u2014 EUROCRYPT\u201990, Lecture Notes in Comput. Sci., 473:266\u2013282, 1991.","DOI":"10.1007\/3-540-46877-3_24"},{"key":"15_CR7","unstructured":"W.-A. Jackson and K. M. Martin. A combinatorial interpretation of ramp schemes. Submitted, 1994."},{"key":"15_CR8","first-page":"65","volume":"14","author":"K. M. Martin","year":"1993","unstructured":"K. M. Martin. New secret sharing schemes from old. J. Combin. Math Combin. Comput., 14:65\u201377, 1993.","journal-title":"J. Combin. Math Combin. Comput."},{"key":"15_CR9","first-page":"187","volume":"46","author":"C. Meadows","year":"1985","unstructured":"C. Meadows. Some threshold schemes without central key distributors. Congressus Numerantium, 46:187\u2013199, 1985.","journal-title":"Congressus Numerantium"},{"issue":"11","key":"15_CR10","doi-asserted-by":"publisher","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, 22(11):612\u2013613, 1979.","journal-title":"Comm. ACM"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"G. J. Simmons. The consequences of trust in shared secret schemes. Adv. in Cryptology \u2014 EUROCRYPT\u201993, Lecture Notes in Comput. Sci., 765:448\u2013452, 1994.","DOI":"10.1007\/3-540-48285-7_40"},{"key":"15_CR12","first-page":"71","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W.-A. Jackson, and K. Martin. The geometry of shared secret schemes. Bull. Inst. Combin. Appl., 1:71\u201388, 1991.","journal-title":"Bull. Inst. Combin. Appl."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2:357\u2013390, 1992.","journal-title":"Des. Codes Cryptogr."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D. R. Stinson","year":"1994","unstructured":"D. R. Stinson. Decomposition constructions for secret sharing schemes. IEEE Trans. Inform. Theory, 40:118\u2013125, 1994.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49264-X_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:09:35Z","timestamp":1556726975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49264-X_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594093","9783540492641"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-49264-x_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1995]]}}}