{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:47Z","timestamp":1725561347361},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_66","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:59:19Z","timestamp":1280379559000},"page":"645-654","source":"Crossref","is-referenced-by-count":2,"title":["Hypergraph Decomposition and Secret Sharing"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]},{"given":"Clemente","family":"Galdi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","series-title":"Lecture Notes in Computer Science","first-page":"27","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Benaloh","year":"1989","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1989)"},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, American Federation of Information Processing Societies Proceedings, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"66_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C. Blundo","year":"1997","unstructured":"Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight Bounds on the Information Rate of Secret Sharing Schemes. Design, Codes, and Cryptography\u00a011, 107\u2013122 (1997)","journal-title":"Design, Codes, and Cryptography"},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","volume":"154","author":"C. Blundo","year":"1996","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the Information Rate of Secret Sharing Schemes. Theoretical Computer Science\u00a0154, 283\u2013306 (1996)","journal-title":"Theoretical Computer Science"},{"key":"66_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"Blundo, C., De Santis, A., Stinson, D.R., Vaccaro, U.: Graph Decomposition and Secret Sharing Schemes. Journal of Cryptology\u00a08, 39\u201364 (1995); Preliminary version appeared in EuroCrypt 92","journal-title":"Journal of Cryptology"},{"key":"66_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E.F. Brickell","year":"1991","unstructured":"Brickell, E.F., Davenport, D.M.: On the Classification of Ideal Secret Sharing Schemes. Journal of Cryptology\u00a04, 123\u2013134 (1991)","journal-title":"Journal of Cryptology"},{"issue":"3","key":"66_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R.M. Capocelli","year":"1993","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the Size of Shares for Secret Sharing Schemes. Journal of Cryptology\u00a06(3), 157\u2013169 (1993)","journal-title":"Journal of Cryptology"},{"key":"66_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Singapore (1991)"},{"issue":"4","key":"66_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L. Csirmaz","year":"1997","unstructured":"Csirmaz, L.: The Size of a Share Must be Large. Journal of Cryptology\u00a010(4), 223\u2013231 (1997)","journal-title":"Journal of Cryptology"},{"key":"66_CR10","first-page":"99","volume-title":"Proceedings of the IEEE Global Telecommunications Conference, Globecom 1987","author":"M. Ito","year":"1987","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings of the IEEE Global Telecommunications Conference, Globecom 1987, pp. 99\u2013102. IEEE Press, Los Alamitos (1987)"},{"key":"66_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"66_CR12","series-title":"Lecture Notes in Computer Science","first-page":"170","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D.R. Stinson","year":"1993","unstructured":"Stinson, D.R.: New General Lower ounds on the Information Rate of Secret Sharing Schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 170\u2013184. Springer, Heidelberg (1993)"},{"key":"66_CR13","doi-asserted-by":"crossref","unstructured":"Stinson, D.R.: Decomposition Constructions for Secret Sharing Schemes. IEEE Transactions on Information Theory\u00a040 (1994)","DOI":"10.1109\/18.272461"},{"key":"66_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: An Explication of Secret Sharing Schemes. Design, Codes and Cryptography\u00a02, 357\u2013390 (1992)","journal-title":"Design, Codes and Cryptography"},{"key":"66_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M. Dijk van","year":"1995","unstructured":"van Dijk, M.: On the Information Rate of Perfect Secret Sharing Schemes. Design, Codes and Cryptography\u00a06, 143\u2013169 (1995)","journal-title":"Design, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T14:58:05Z","timestamp":1591714685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}