{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:19:04Z","timestamp":1753888744857,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573401"},{"type":"electronic","value":"9783540480716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-48071-4_11","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"148-167","source":"Crossref","is-referenced-by-count":39,"title":["On the Information Rate of Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"C.","family":"Blundo","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":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology-CRYPTO 88","author":"J. C. Benaloh","year":"1988","unstructured":"J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, in \u201cAdvances in Cryptology-CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 27\u201335."},{"key":"11_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":"11_CR3","volume-title":"Secret Sharing Schemes for Access Structures based on Graphs","author":"C. Blundo","year":"1991","unstructured":"C. Blundo Secret Sharing Schemes for Access Structures based on Graphs, Tesi di Laurea, University of Salerno, Italy, 1991, (in Italian)."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Eurocrypt 1992, Hungary.","DOI":"10.1007\/3-540-47555-9_1"},{"key":"11_CR5","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":"11_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-38424-3_17","volume-title":"Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, Lecture Notes in Computer Science, 537:242\u2013252, 1991. To appear in J. Cryptology."},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"Advances in Cryptology-CRYPTO 91","author":"R. M. Capocelli","year":"1991","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, in \u201cAdvances in Cryptology-CRYPTO 91\u201d, Ed. J. Feigenbaum, vol. 576 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 101\u2013113. To appear in J. Cryptology."},{"key":"11_CR8","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner, Information Theory. Coding theorems for discrete memoryless systems, Academic Press, 1981."},{"key":"11_CR9","unstructured":"P. Erd\u00f6s and L. Pyber, unpublished."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"T. Feder and R. Motwani, Clique Partition, Graph Compression and Speeding-up Algorithms, Proceedings of the 23rd Annual ACM Sympsoium on Theory of Computing, New Orleans, 1991, pp. 123\u2013133.","DOI":"10.1145\/103418.103424"},{"key":"11_CR11","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":"11_CR12","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979."},{"issue":"1","key":"11_CR13","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":"11_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-39568-7_19","volume-title":"Advances in Cryptology-CRYPTO 84","author":"S. C. Kothari","year":"1984","unstructured":"S. C. Kothari, Generalized Linear Threshold Schemes, in \u201cAdvances in Cryptology-CRYPTO 84\u201d, G. R. Blakley and D. Chaum Eds., vol. 196 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 231\u2013241."},{"key":"11_CR15","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."},{"key":"11_CR16","unstructured":"K. M. Martin, Discrete Structures in the Theory of Secret Sharing, PhD Thesis, University of London, 1991."},{"key":"11_CR17","unstructured":"K. M. Martin, New secret sharing schemes from old, submitted to Journal of Combin. Math. and Combin. Comput."},{"key":"11_CR18","unstructured":"L. Pyber, Covering the Edges of a Graph by..., in Sets, Graphs and Numbers, Colloquia Mathematica Soc. J\u00e1nos Bolyai, L. Lov\u00e1sz, D. Mikl\u00f3s, T. Sz\u00f6nyi, Eds., (to appear)."},{"issue":"11","key":"11_CR19","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":"11_CR20","doi-asserted-by":"crossref","unstructured":"G. J. Simmons, An Introduction to Shared Secret and\/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441\u2013497, 1991.","DOI":"10.1007\/3-540-38424-3_16"},{"key":"11_CR21","unstructured":"D. R. Stinson, An Explication of Secret Sharing Schemes, Technical Report UNL-CSE-92-004, Department of Computer Science and Engineering, University of Nebraska, February 1992."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02579163","volume":"4","author":"Z. Tuza","year":"1984","unstructured":"Z. Tuza, Covering of Graphs by Complete Bipartite Subgraphs; Complexity of 0\u20131 matrices, Combinatorica, vol. 4, n. 1, pp. 111\u2013116, 1984.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:19:42Z","timestamp":1737346782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573401","9783540480716"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1993]]}}}