{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:46:50Z","timestamp":1766065610401},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf00189262","type":"journal-article","created":{"date-parts":[[2004,9,25]],"date-time":"2004-09-25T06:28:10Z","timestamp":1096093690000},"page":"233-250","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Ideal secret sharing schemes with multiple secrets"],"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":"BF00189262_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-48071-4_13","volume-title":"Advances in Cryptology\u2014CRYPTO '92","author":"A. Beimel","year":"1993","unstructured":"A. Beimel and B. Chor. Universally ideal secret sharing schemes. Advances in Cryptology\u2014CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 183\u2013195. Springer-Verlag, Berlin, 1993."},{"key":"BF00189262_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/3-540-48071-4_38","volume-title":"Advances in Cryptology\u2014CRYPTO '92","author":"B. Blakley","year":"1993","unstructured":"B. Blakley, G. R. Blakley, A. H. Chan, and J. Massey. Threshold schemes with disenrollment. Advances in Cryptology\u2014CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 540\u2013548. Springer-Verlag, Berlin, 1993."},{"key":"BF00189262_CR3","series-title":"Lecture Notes in Computer Science","first-page":"335","volume-title":"Advances in Cryptology\u2014EUROCRYPT '84","author":"R. Blom","year":"1984","unstructured":"R. Blom. An optimal class of symmetric key generation systems. Advances in Cryptology\u2014EUROCRYPT '84. Lecture Notes in Computer Science, Vol. 209, pp. 335\u2013338. Springer-Verlag, Berlin, 1984."},{"key":"BF00189262_CR4","doi-asserted-by":"crossref","unstructured":"C. Blundo and A. Cresti. Space requirements for broadcast encryption. Presented at EUROCRYPT '94, 1994.","DOI":"10.1007\/BFb0053444"},{"key":"BF00189262_CR5","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Advances in Cryptology\u2014CRYPTO '93. Lecture Notes in Computer Science, Vol. 773 pp. 110\u2013125.","DOI":"10.1007\/3-540-48329-2_10"},{"key":"BF00189262_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-48658-5_17","volume-title":"Advances in Cryptology\u2014CRYPTO '94","author":"C. Blundo","year":"1994","unstructured":"C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia, and U. Vaccaro. Multi-secret sharing schemes. Advances in Cryptology\u2014CRYPTO '94. Lecture Notes in Computer Science, Vol. 839, pp. 150\u2013163. Springer-Verlag, Berlin, 1994."},{"key":"BF00189262_CR7","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Herzberg, and S. Kutten, Perfectly-secure key distribution for dynamic conferences. Advances in Cryptology\u2014CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 471\u2013486.","DOI":"10.1007\/3-540-48071-4_33"},{"key":"BF00189262_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","volume-title":"Proc. STACS '93","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro. Efficient sharing of many secrets. Proc. STACS '93. Lecture Notes in Computer Science, Vol. 665 pp. 692\u2013703. Springer-Verlag, Berlin, 1993."},{"key":"BF00189262_CR9","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput., 9:105\u2013113, 1989.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"BF00189262_CR10","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, 4:123\u2013134, 1991.","journal-title":"J. Cryptology"},{"key":"BF00189262_CR11","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung. Communication complexity of secure computation. Proc. 24th ACM Symp. on the Theory of Computing (STOC), pp. 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"BF00189262_CR12","unstructured":"W.-A. Jackson and K. M. Martin. Combinatorial models for perfect secret sharing schemes. J. Combin. Math. Combin. Comput., to appear."},{"key":"BF00189262_CR13","unstructured":"W.-A. Jackson and K. M. Martin. Efficient constructions for one sharing of many secrets. PM95-003, Pure Mathematics Preprint Series, University of Adelaide."},{"key":"BF00189262_CR14","series-title":"Lecture Notes in Cpmputer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48329-2_11","volume-title":"Advances in Cryptology\u2014CRYPTO '93","author":"W.-A. Jackson","year":"1994","unstructured":"W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. Multisecret threshold schemes. Advances in Cryptology\u2014CRYPTO '93. Lecture Notes in Cpmputer Science, Vol. 773, pp. 126\u2013135. Springer-Verlag, Berlin, 1994."},{"key":"BF00189262_CR15","unstructured":"W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. A construction for multisecret threshold schemes. PM95-004, Pure Mathematics Preprint Series, University of Adelaide."},{"key":"BF00189262_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. Inform. Theory, 29:35\u201341, 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF00189262_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/0-387-34805-0_26","volume-title":"Advances in Cryptology\u2014CRYPTO '89","author":"C.-S. Laih","year":"1990","unstructured":"C.-S. Laih, L. Harn, J.-Y. Lee, and T. Hwang. Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space. Advances in Cryptology\u2014CRYPTO '89. Lecture Notes in Computer Science, Vol. 435, pp. 286\u2013297. Springer-Verlag, Berlin, 1990."},{"key":"BF00189262_CR18","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":"BF00189262_CR19","unstructured":"K. M. Martin. Untrustworthy participants in secret sharing schemes. Proc. 3rd IMA Conf. on Cryptography and Coding, pp. 255\u2013264, 1993."},{"key":"BF00189262_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-48184-2_14","volume-title":"Advances in Cryptology\u2014CRYPTO '87","author":"T. Matsumoto","year":"1988","unstructured":"T. Matsumoto and H. Imai. On the key predistribution system: a practical solution to the key distribution problem. Advances in Cryptology\u2014CRYPTO '87. Lecture Notes in Computer Science, Vol. 293, pp. 185\u2013193. Springer-Verlag, Berlin, 1988."},{"issue":"9","key":"BF00189262_CR21","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9):583\u2013584, 1981.","journal-title":"Comm. ACM"},{"key":"BF00189262_CR22","volume-title":"Matroid Theory","author":"J. G. Oxley","year":"1992","unstructured":"J. G. Oxley. Matroid Theory. Oxford University Press, Oxford, 1992."},{"key":"BF00189262_CR23","unstructured":"C. Schulze. Multifunctional shared secret schemes. Preprint, 1994."},{"key":"BF00189262_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P. D. Seymour","year":"1992","unstructured":"P. D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B, 56:69\u201373, 1992.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF00189262_CR25","first-page":"441","volume-title":"Contemporary Cryptology","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons. An introduction to shared secret and\/or shared control schemes and their application. In Contemporary Cryptology, pp. 441\u2013497. Edited by G. J. Simmons. IEEE Press, New York, 1991."},{"key":"BF00189262_CR26","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(94)90127-9","volume":"52","author":"H.-M. Sun","year":"1994","unstructured":"H.-M. Sun and S.-P. Shieh. On dynamic threshold schemes. Inform. Process. Lett., 52:201\u2013206, 1994.","journal-title":"Inform. Process. Lett."},{"key":"BF00189262_CR27","first-page":"1124","volume":"9","author":"T. Uehara","year":"1986","unstructured":"T. Uehara, T. Nishizeki, and K. Nakamura. A secret sharing system with matroidal access structure. Trans. IECE Japan, J69-A 9:1124\u20131132, 1986.","journal-title":"Trans. IECE Japan, J69-A"},{"key":"BF00189262_CR28","volume-title":"Codes and Cryptography","author":"D. Welsh","year":"1988","unstructured":"D. Welsh. Codes and Cryptography. Clarendon Press, Oxford, 1988."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00189262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00189262\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00189262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00189262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:32:40Z","timestamp":1586334760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00189262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF00189262"],"URL":"https:\/\/doi.org\/10.1007\/bf00189262","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]},"assertion":[{"value":"14 November 1994","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 1995","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}