{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:02Z","timestamp":1772283662645,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf00198463","type":"journal-article","created":{"date-parts":[[2004,8,29]],"date-time":"2004-08-29T02:50:56Z","timestamp":1093747856000},"page":"157-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":176,"title":["On the size of shares for secret sharing schemes"],"prefix":"10.1007","volume":"6","author":[{"given":"R. M.","family":"Capocelli","sequence":"first","affiliation":[]},{"given":"A.","family":"De Santis","sequence":"additional","affiliation":[]},{"given":"L.","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00198463_CR1","doi-asserted-by":"crossref","unstructured":"J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Proceedings of Crypto '88\u2014Advances in Cryptology, Lecture Notes in Computer Science, vol. 403, S. Goldwasser, ed., Springer-Verlag, Berlin, 1990, pp. 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"BF00198463_CR2","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings of AFIPS 1979 National Computer Conference, vol. 48, New York, June 1979, pp. 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"BF00198463_CR3","doi-asserted-by":"crossref","unstructured":"G. R. Blakley and C. Meadows, Security of Ramp Schemes, Proceedings of Crypto '84\u2014Advances in Cryptology, Lecture Notes in Computer Science, vol. 196, G. R. Blakley and D. Chaum, eds., Springer-Verlag, Berlin, 1985, pp. 411\u2013431.","DOI":"10.1007\/3-540-39568-7"},{"key":"BF00198463_CR4","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Proceedings of Eurocrypt '92\u2014Advances in Cryptology, Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear."},{"issue":"no. 2","key":"BF00198463_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"vol. 4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, Journal of Cryptology, vol. 4, no. 2, 1991, pp. 123\u2013134.","journal-title":"Journal of Cryptology"},{"key":"BF00198463_CR6","doi-asserted-by":"crossref","unstructured":"E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, Proceedings of Crypto '90\u2014Advances in Cryptology, Lecture Notes in Computer Science, vol. 576, S. A. Vanstone, ed., Springer-Verlag, Berlin, 1992, pp. 242\u2013252.","DOI":"10.1007\/3-540-38424-3_17"},{"key":"BF00198463_CR7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-1-4613-9323-8_25","volume-title":"Sequences II: Methods in Communications, Security and Computer Science","author":"R. M. Capocelli","year":"1993","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, A Note on Secret Sharing Schemes, in: Sequences II: Methods in Communications, Security and Computer Science, R. M. Capocelli, A. De Santis, and U. Vaccaro, eds., Springer-Verlag, Berlin, 1993, pp. 335\u2013344."},{"key":"BF00198463_CR8","volume-title":"Information Theory. Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1981","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, 1981."},{"key":"BF00198463_CR9","volume-title":"Cryptography and Data Security","author":"D. Denning","year":"1983","unstructured":"D. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983."},{"key":"BF00198463_CR10","volume-title":"Information Theory and Reliable Communications","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager, Information Theory and Reliable Communications, Wiley, New York, 1968."},{"key":"BF00198463_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"BF00198463_CR12","unstructured":"M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure, Proceedings of IEEE Global Telecommunications Conference\u2014Globecom 87, Tokyo, 1987, pp. 99\u2013102."},{"issue":"no. 1","key":"BF00198463_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"vol. 29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Transactions on Information Theory, vol. 29, no. 1, 1983, pp. 35\u201341.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF00198463_CR14","doi-asserted-by":"crossref","unstructured":"S. C. Kothari, Generalized Linear Threshold Schemes, Proceedings of Crypto '84\u2014Advances in Cryptology, Lecture Notes in Computer Science, vol. 196, G. R. Blakley and D. Chaum, eds., Springer-Verlag, Berlin, 1985, pp. 231\u2013241.","DOI":"10.1007\/3-540-39568-7_19"},{"issue":"no. 11","key":"BF00198463_CR15","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"vol. 22","author":"A Shamir","year":"1979","unstructured":"A Shamir, How To Share a Secret, Communications of the ACM, vol. 22, no. 11, 1979, pp. 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"BF00198463_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"vol. 27","author":"C. E. Shannon","year":"July\/Oct. 1948","unstructured":"C. E. Shannon, The Mathematical Theory of Communication, Bell. Systems Journal, vol. 27, July\/Oct. 1948, pp. 379\u2013423, 623\u2013656.","journal-title":"Bell. Systems Journal"},{"key":"BF00198463_CR17","first-page":"215","volume":"vol. 8","author":"G. J. Simmons","year":"1989","unstructured":"G. J. Simmons, Robust Shared Secret Schemes or \u201cHow To Be Sure You Have the Right Answer Even Though You Don't Know the Question,\u201d Congressus Numerantium, vol. 8, 1989, pp. 215\u2013248.","journal-title":"Congressus Numerantium"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00198463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00198463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00198463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00198463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:28:16Z","timestamp":1586334496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00198463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF00198463"],"URL":"https:\/\/doi.org\/10.1007\/bf00198463","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]},"assertion":[{"value":"25 November 1991","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 1992","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"}]}}