{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:05Z","timestamp":1759638605615,"version":"3.41.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":[[1998,12]]},"DOI":"10.1023\/a:1008381427667","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"301-321","source":"Crossref","is-referenced-by-count":14,"title":["A General Decomposition Construction for Incomplete Secret Sharing Schemes"],"prefix":"10.1007","volume":"15","author":[{"given":"Marten van","family":"Dijk","sequence":"first","affiliation":[]},{"given":"Wen-Ai","family":"Jackson","sequence":"additional","affiliation":[]},{"given":"Keith M.","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"185609_CR1","doi-asserted-by":"crossref","unstructured":"P. Beguin and A. Cresti, General short computational secret sharing schemes, Adv. in Cryptology: EUROCRYPT' 95, Lecture Notes in Comput. Sci., 921 (1995) pp. 194-208.","DOI":"10.1007\/3-540-49264-X_16"},{"key":"185609_CR2","doi-asserted-by":"crossref","unstructured":"A. Beutelspacher, How to say no, Advances in Cryptology: Proceedings of EUROCRYPT' 89, Lecture Notes in Comput. Sci., 434 (1990) pp. 491-496.","DOI":"10.1007\/3-540-46885-4_47"},{"key":"185609_CR3","doi-asserted-by":"crossref","unstructured":"G. R. Blakley and G. A. Kabatianski, On general perfect secret sharing schemes, Adv. in Cryptology: CRYPTO'95, Lecture Notes in Comput. Sci., 963 (1995) pp. 367-371.","DOI":"10.1007\/3-540-44750-4_29"},{"key":"185609_CR4","doi-asserted-by":"crossref","unstructured":"G. R. Blakley and C. Meadows, Security of ramp schemes, Adv. in Cryptology: CRYPTO' 84, Lecture Notes in Comput. Sci., 196 (1985) pp. 242-268.","DOI":"10.1007\/3-540-39568-7_20"},{"key":"185609_CR5","unstructured":"C. Blundo, Secret sharing schemes for access structures based on graphs, Tesi di Laurea, 1991. (in Italian)."},{"key":"185609_CR6","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, Perfectly-secure key distribution for dynamic conferences, Adv. in Cryptology: CRYPTO'92, Lecture Notes in Comput. Sci., 740 (1993) pp. 471-481.","DOI":"10.1007\/3-540-48071-4_33"},{"key":"185609_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology, Vol. 8 (1995) pp. 39-64.","journal-title":"J. Cryptology"},{"key":"185609_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, Vol. 4 (1991) pp. 123-134.","journal-title":"J. Cryptology"},{"key":"185609_CR9","doi-asserted-by":"crossref","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, Vol. 5 (1992) pp. 153-166.","journal-title":"J. Cryptology"},{"key":"185609_CR10","doi-asserted-by":"crossref","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, A note on secret sharing schemes, Sequences II: Methods in Communications, Security and Computer Science, Springer Verlag (1993) pp. 335-344.","DOI":"10.1007\/978-1-4613-9323-8_25"},{"key":"185609_CR11","doi-asserted-by":"crossref","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, Vol. 6 (1993) pp. 157-167.","journal-title":"J. Cryptology"},{"key":"185609_CR12","unstructured":"T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley and Sons, Inc. (1991)."},{"key":"185609_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M. van Dijk","year":"1995","unstructured":"M. van Dijk, On the information rate of perfect secret sharing schemes, Designs, Codes, and Cryptography, Vol. 6 (1995) pp. 143-169.","journal-title":"Designs, Codes, and Cryptography"},{"key":"185609_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1008259214236","volume":"12","author":"M. van Dijk","year":"1997","unstructured":"M. van Dijk, A linear construction of secret sharing schemes, Designs, Codes and Cryptography., Vol. 12 (1997) pp. 161-201.","journal-title":"Designs, Codes and Cryptography"},{"key":"185609_CR15","volume-title":"Information Theory and Reliable Communications","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager. Information Theory and Reliable Communications, John Wiley, New York (1968)."},{"key":"185609_CR16","unstructured":"W.-A. Jackson and K. M. Martin, Combinatorial models for perfect secret sharing schemes, to appear in Journal of Combin. Math. and Combin. Comput."},{"key":"185609_CR17","first-page":"267","volume":"9","author":"W.-A. Jackson","year":"1996","unstructured":"W.-A. Jackson and K. M. Martin, Perfect secret sharing schemes on five participants, Designs, Codes and Cryptography, Vol. 9 (1996) pp. 267-286.","journal-title":"Designs, Codes and Cryptography"},{"key":"185609_CR18","doi-asserted-by":"crossref","unstructured":"W.-A. Jackson, K. M. Martin, and C. M. O'Keefe, Efficient secret sharing without a mutually trusted authority, Adv. in Cryptology: EUROCRYPT' 95, Lecture Notes in Comput. Sci., 921 (1995) pp. 183-193.","DOI":"10.1007\/3-540-49264-X_15"},{"key":"185609_CR19","unstructured":"W.-A. Jackson and K. M. Martin, An algorithm for efficient geometric secret sharing schemes, to appear in Utilitas Mathematica."},{"key":"185609_CR20","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii, Nonperfect secret sharing schemes and matroids, Adv. in Cryptology: EUROCRYPT' 93, Lecture Notes in Comput. Sci., 765 (1994) pp. 126-141.","DOI":"10.1007\/3-540-48285-7_11"},{"key":"185609_CR21","unstructured":"K. M. Martin, Discrete structures in the theory of secret sharing, PhD thesis, Royal Holloway and Bedford New College, University of London (1991)."},{"key":"185609_CR22","first-page":"65","volume":"14","author":"K. M. Martin","year":"1993","unstructured":"K. M. Martin, New secret sharing schemes from old, Journal of Combin. Math. and Combin. Comput., Vol. 14 (1993) pp. 65-77.","journal-title":"Journal of Combin. Math. and Combin. Comput."},{"key":"185609_CR23","doi-asserted-by":"crossref","unstructured":"W. Ogata, K. Kurosawa, and S. Tsujii, Nonperfect secret sharing schemes, Adv. in Cryptology: AUSCRYPT' 92, Lecture Notes in Comput. Sci., 718 (1993) pp. 56-66.","DOI":"10.1007\/3-540-57220-1_52"},{"key":"185609_CR24","doi-asserted-by":"crossref","unstructured":"K. Okada and K. Kurosawa, Lower bound on the size of shares of nonperfect secret sharing schemes, Proceedings of ASIACRYPT' 94, Lecture Notes in Comput. Sci., (1995) pp. 33-41.","DOI":"10.1007\/BFb0000422"},{"key":"185609_CR25","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, Commun. of the ACM, Vol. 22 (1979) pp. 612-613.","journal-title":"Commun. of the ACM"},{"key":"185609_CR26","unstructured":"G. J. Simmons, An introduction to shared secret and\/or shared control schemes and their application, Contemporary Cryptology, The Science of Information Integrity, (G. J. Simmons, ed.), IEEE Press (1992)."},{"key":"185609_CR27","unstructured":"D. R. Stinson, Bibliography on secret sharing schemes, available online. http:\/\/bibd.unl.edu\/~stinson\/ssbib.html."},{"key":"185609_CR28","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 secret sharing schemes, Designs, Codes and Cryptography, Vol. 2 (1992) pp. 357-390.","journal-title":"Designs, Codes and Cryptography"},{"key":"185609_CR29","first-page":"168","volume":"740","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson. New general lower bounds on the information rate of secret sharing schemes, Advances in Cryptology: CRYPTO' 92, Lecture Notes in Comput. Sci., 740 (1993) pp. 168-182.","journal-title":"Advances in Cryptology: CRYPTO' 92"},{"key":"185609_CR30","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/18.272461","volume":"IT-40","author":"D. R. Stinson","year":"1994","unstructured":"D. R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory, Vol. IT-40 (1994) pp. 118-125.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008381427667.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008381427667\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008381427667.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:45:31Z","timestamp":1753760731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008381427667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["185609"],"URL":"https:\/\/doi.org\/10.1023\/a:1008381427667","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}