{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:15Z","timestamp":1725565395033},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_8","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T11:51:35Z","timestamp":1284119495000},"page":"93-109","source":"Crossref","is-referenced-by-count":3,"title":["On the Optimization of Bipartite Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica Ruth","family":"Metcalf-Burton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonor","family":"V\u00e1zquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480102412868","volume":"19","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Ishai, Y.: On the power of nonlinear secret sharing schemes. SIAM J. Discrete Math.\u00a019, 258\u2013280 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/11681878_25","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2006","unstructured":"Beimel, A., Livne, N.: On Matroids and Non-ideal Secret Sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 482\u2013501. Springer, Heidelberg (2006)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-78524-8_12","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Livne, N., Padr\u00f3, C.: Matroids Can Be Far From Ideal Secret Sharing. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 194\u2013212. Springer, Heidelberg (2008)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-00457-5_32","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2009","unstructured":"Beimel, A., Orlov, I.: Secret Sharing and Non-Shannon Information Inequalities. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 539\u2013557. Springer, Heidelberg (2009)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0895480104445654","volume":"22","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discrete Math.\u00a022, 360\u2013397 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S0097539704444038","volume":"34","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Weinreb, E.: Separating the power of monotone span programs over different fields. SIAM J. Comput.\u00a034, 1196\u20131215 (2005)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ipl.2005.09.008","volume":"97","author":"A. Beimel","year":"2006","unstructured":"Beimel, A., Weinreb, E.: Monotone Circuits for Monotone Weighted Threshold Functions. Information Processing Letters\u00a097, 12\u201318 (2006)","journal-title":"Information Processing Letters"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"8_CR9","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., Gargano, L., Vaccaro, U.: Tight Bounds on the Information Rate of Secret Sharing Schemes. Des. Codes Cryptogr.\u00a011, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR10","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput.\u00a09, 105\u2013113 (1989)","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"8_CR11","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. J. Cryptology\u00a04, 123\u2013134 (1991)","journal-title":"J. Cryptology"},{"key":"8_CR12","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. J. Cryptology\u00a010, 223\u2013231 (1997)","journal-title":"J. Cryptology"},{"key":"8_CR13","unstructured":"L. Csirmaz, G. Tardos. Secret sharing on trees: problem solved (preprint) (2009), Cryptology ePrint Archive, http:\/\/eprint.iacr.org\/2009\/071"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-72540-4_26","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"O. Farr\u00e0s","year":"2007","unstructured":"Farr\u00e0s, O., Mart\u00ed\u2013Farr\u00e9, J., Padr\u00f3, C.: Ideal Multipartite Secret Sharing Schemes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 448\u2013465. Springer, Heidelberg (2007); The full version of this paper is available at the Cryptology ePrint Archive, http:\/\/eprint.iacr.org\/2006\/292"},{"key":"8_CR15","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Ideal Hierarchical Secret Sharing Schemes. Cryptology ePrint Archive, Report 2009\/141, http:\/\/eprint.iacr.org\/2009\/141"},{"key":"8_CR16","unstructured":"Fehr, S.: Efficient Construction of the Dual Span Program (manuscript)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0019-9958(78)91063-X","volume":"39","author":"S. Fujishige","year":"1978","unstructured":"Fujishige, S.: Polymatroidal Dependence Structure of a Set of Random Variables. Information and Control\u00a039, 55\u201372 (1978)","journal-title":"Information and Control"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1049\/ip-ifs:20060081","volume":"153","author":"J. Herranz","year":"2006","unstructured":"Herranz, J., S\u00e1ez, G.: New Results on Multipartite Access Structures. IEEE Proceedings on Information Security\u00a0153, 153\u2013162 (2006)","journal-title":"IEEE Proceedings on Information Security"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1021852421716","volume":"16","author":"J. Herzog","year":"2002","unstructured":"Herzog, J., Hibi, T.: Discrete polymatroids. J. Algebraic Combin.\u00a016, 239\u2013268 (2002)","journal-title":"J. Algebraic Combin."},{"key":"8_CR20","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom 1987, pp. 99\u2013102 (1987)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W.-A. Jackson","year":"1994","unstructured":"Jackson, W.-A., Martin, K.M.: Geometric secret sharing schemes and their duals. Des. Codes Cryptogr.\u00a04, 83\u201395 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-70936-7_15","volume-title":"Theory of Cryptography","author":"J. Mart\u00ed-Farr\u00e9","year":"2007","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On Secret Sharing Schemes, Matroids and Polymatroids. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 273\u2013290. Springer, Heidelberg (2007); The full version of this paper is available at the Cryptology ePrint Archive, http:\/\/eprint.iacr.org\/2006\/077"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F. Mat\u00fa\u0161","year":"1999","unstructured":"Mat\u00fa\u0161, F.: Matroid representations by partitions. Discrete Math.\u00a0203, 169\u2013194 (1999)","journal-title":"Discrete Math."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1016\/j.disc.2006.11.013","volume":"307","author":"F. Mat\u00fa\u0161","year":"2007","unstructured":"Mat\u00fa\u0161, F.: Adhesivity of polymatroids. Discrete Math.\u00a0307, 2464\u20132477 (2007)","journal-title":"Discrete Math."},{"key":"8_CR25","unstructured":"Metcalf-Burton, J.R.: Information Rates of Minimal Non-Matroid-Related Access Structures. arxiv.org\/pdf\/0801.3642"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(99)00070-8","volume":"70","author":"P. Morillo","year":"1999","unstructured":"Morillo, P., Padr\u00f3, C., S\u00e1ez, G., Villar, J.L.: Weighted Threshold Secret Sharing Schemes. Inf. Process. Lett.\u00a070, 211\u2013216 (1999)","journal-title":"Inf. Process. Lett."},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/18.887867","volume":"46","author":"C. Padr\u00f3","year":"2000","unstructured":"Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inform. Theory\u00a046, 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR28","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. Commun. of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Commun. of the ACM"},{"issue":"4","key":"8_CR29","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C. E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A Mathematical Theory of Communication. Bell. Sys. Tech. Journal\u00a027 (1948)","journal-title":"Bell System Technical Journal"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"G.J. Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (Really) Share a Secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 390\u2013448. Springer, Heidelberg (1990)"},{"key":"8_CR31","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. Des. Codes Cryptogr.\u00a02, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition constructions for secret-sharing schemes. IEEE Transactions on Information Theory\u00a040, 118\u2013125 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR33","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/18.370142","volume":"IT-41","author":"R.W. Yeung","year":"1995","unstructured":"Yeung, R.W.: A framework for linear information inequalities. IEEE Trans. Inform. Theory\u00a0IT-41, 412\u2013422 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","volume-title":"A First Course in Information Theory","author":"R.W. Yeung","year":"2002","unstructured":"Yeung, R.W.: A First Course in Information Theory. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:28:09Z","timestamp":1619785689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}