{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:39:22Z","timestamp":1778297962479,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"},{"value":"9783540467663","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-46766-1_7","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T11:03:27Z","timestamp":1186830207000},"page":"101-113","source":"Crossref","is-referenced-by-count":33,"title":["On the Size of Shares for Secret Sharing Schemes"],"prefix":"10.1007","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","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Crypto 88, pp. 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313\u2013317, June 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"7_CR3","unstructured":"E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, to appear."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, Crypto 90 (Published also as Research Report #106, May 1990, University of Nebraska).","DOI":"10.1007\/3-540-38424-3_17"},{"key":"7_CR5","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner, Information Theory. Coding theorems for discrete memoryless systems, Academic Press, 1981."},{"key":"7_CR6","volume-title":"Cryptography and Data Security","author":"D. Denning","year":"1983","unstructured":"D. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983."},{"key":"7_CR7","volume-title":"Information Theory and Reliable Communications","author":"R. G. Gallager","year":"1968","unstructured":"R. G. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York, NY, 1968."},{"key":"7_CR8","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, 1987, New York, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"7_CR9","unstructured":"M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987, pp. 99\u2013102."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, vol. IT-29, no. 1, Jan. 1983, pp. 35\u201341.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"S. C. Kothari, Generalized Linear Threshold Schemes, Crypto 84, pp. 231\u2013241.","DOI":"10.1007\/3-540-39568-7_19"},{"issue":"11","key":"7_CR12","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, Communications of the ACM, vol. 22, n. 11, pp. 612\u2013613, Nov. 1979.","journal-title":"Communications of the ACM"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. E. Shannon","year":"1948","unstructured":"C. E. Shannon, The Mathematical Theory of Communication, Bell. Syst. J., vol. 27, pp. 379\u2013423, 623\u2013656, July\/Oct. 1948.","journal-title":"Bell. Syst. J."},{"key":"7_CR14","first-page":"215","volume":"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\u2019t Know the Question\u201d, Congressus Numerantium, vol. 8, pp. 215\u2013248, 1989.","journal-title":"Congressus Numerantium"},{"key":"7_CR15","first-page":"59","volume":"1","author":"G.J. Simmons","year":"1991","unstructured":"G.J. Simmons, The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Applications (ICA), vol. 1, pp. 59\u201370, Jan. 1991.","journal-title":"Bulletin of the Institute of Combinatorics and its Applications (ICA)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T16:12:55Z","timestamp":1587831175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551881","9783540467663"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1992]]}}}