{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:25Z","timestamp":1764996925224},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,8,24]],"date-time":"2011-08-24T00:00:00Z","timestamp":1314144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10623-011-9552-7","type":"journal-article","created":{"date-parts":[[2011,8,23]],"date-time":"2011-08-23T17:19:00Z","timestamp":1314119940000},"page":"255-271","source":"Crossref","is-referenced-by-count":15,"title":["On the optimization of bipartite secret sharing schemes"],"prefix":"10.1007","volume":"63","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","published-online":{"date-parts":[[2011,8,24]]},"reference":[{"key":"9552_CR1","doi-asserted-by":"crossref","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. 19, 258\u2013280 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"9552_CR2","doi-asserted-by":"crossref","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. 34, 1196\u20131215 (2005)","journal-title":"SIAM J. Comput."},{"key":"9552_CR3","doi-asserted-by":"crossref","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. Inform. Process. Lett. 97, 12\u201318 (2006)","journal-title":"Inform. Process. Lett."},{"key":"9552_CR4","unstructured":"Beimel A., Livne N., Padr\u00f3 C.: Matroids can be far from ideal secret sharing. Theory of Cryptography Conference, TCC 2008. Lect. Notes Comput. Sci. vol. 4948, pp. 194\u2013212 (2008)."},{"key":"9552_CR5","doi-asserted-by":"crossref","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. 22, 360\u2013397 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"9552_CR6","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. AFIPS Conference Proceedings, vol. 48, pp. 313\u2013317 (1979)."},{"key":"9552_CR7","doi-asserted-by":"crossref","unstructured":"Blundo C., De Santis A., Gargano L., Vaccaro U.: On the information rate of secret sharing schemes. Advances in Cryptology\u2014CRYPTO\u201992. Lecture Notes in Comput. Sci. vol. 740, pp. 148\u2013167 (1993).","DOI":"10.1007\/3-540-48071-4_11"},{"key":"9552_CR8","doi-asserted-by":"crossref","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 decompositions and secret sharing schemes. J. Cryptol. 8, 39\u201364 (1995)","journal-title":"J. Cryptol."},{"key":"9552_CR9","doi-asserted-by":"crossref","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. Des. Codes Cryptogr. 11, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"9552_CR10","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 9, 105\u2013113 (1989)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"9552_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. Cryptol. 4, 123\u2013134 (1991)","journal-title":"J. Cryptol."},{"key":"9552_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"E.F. Brickell","year":"1992","unstructured":"Brickell E.F., Stinson D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptol. 5, 153\u2013166 (1992)","journal-title":"J. Cryptol."},{"key":"9552_CR13","doi-asserted-by":"crossref","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 of secret sharing schemes. J. Cryptol. 6, 157\u2013168 (1993)","journal-title":"J. Cryptol."},{"key":"9552_CR14","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"2006","unstructured":"Cover T.M., Thomas J.A.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)","edition":"2"},{"key":"9552_CR15","doi-asserted-by":"crossref","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. Cryptol. 10, 223\u2013231 (1997)","journal-title":"J. Cryptol."},{"key":"9552_CR16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10623-009-9304-0","volume":"53","author":"L. Csirmaz","year":"2009","unstructured":"Csirmaz L.: An impossibility result on graph secret sharing. Des. Codes Cryptogr. 53, 195\u2013209 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"9552_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00607-009-0039-6","volume":"85","author":"L. Csirmaz","year":"2009","unstructured":"Csirmaz L., Ligeti P.: On an infinite family of graphs with information ratio 2 \u2212 1\/k. Computing 85, 127\u2013136 (2009)","journal-title":"Computing"},{"key":"9552_CR18","unstructured":"Csirmaz L., Tardos G.: Secret sharing on trees: problem solved. Preprint (2009). Available at Cryptology ePrint Archive. http:\/\/eprint.iacr.org\/2009\/071 ."},{"key":"9552_CR19","unstructured":"Farr\u00e0s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. Advances in Cryptology, EUROCRYPT 2007, Lecture Notes in Comput. Sci., vol. 4515, pp. 448\u2013465 (2007). The full version of this paper is available at the Cryptology ePrint Archive, Report 2006\/292, http:\/\/eprint.iacr.org\/2006\/292 ."},{"key":"9552_CR20","unstructured":"Farr\u00e0s O., Padr\u00f3 C.: Ideal hierarchical secret sharing schemes. Seventh IACR Theory of Cryptography Conference, TCC 2010, Lecture Notes in Comput. Sci., vol. 5978, pp. 219\u2013236 (2010). The full version of this paper is available at the Cryptology ePrint Archive, Report 2009\/141, http:\/\/eprint.iacr.org\/2009\/141"},{"key":"9552_CR21","doi-asserted-by":"crossref","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. Inform. Control. 39, 55\u201372 (1978)","journal-title":"Inform. Control."},{"key":"9552_CR22","unstructured":"G\u00e1l A.: A characterization of span program size and improved lower bounds for monotone span programs. In: Proceedings of 30th ACM Symposium on the Theory of Computing, STOC 1998, pp. 429\u2013437 (1998)."},{"key":"9552_CR23","doi-asserted-by":"crossref","unstructured":"Ingleton A.W.: Conditions for representability and transversability of matroids. In Proc. Fr. Br. Conf. 1970, pp. 62\u201367. Springer (1971).","DOI":"10.1007\/BFb0061075"},{"key":"9552_CR24","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom\u201987, pp. 99\u2013102 (1987)."},{"key":"9552_CR25","doi-asserted-by":"crossref","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. 4, 83\u201395 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"9552_CR26","first-page":"267","volume":"9","author":"W.-A. Jackson","year":"1996","unstructured":"Jackson W.-A., Martin K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 267\u2013286 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"9552_CR27","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1515\/jmc.2010.004","volume":"4","author":"J. Mart\u00ed-Farr\u00e9","year":"2010","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4, 95\u2013120 (2010)","journal-title":"J. Math. Cryptol."},{"key":"9552_CR28","doi-asserted-by":"crossref","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3, C. V\u00e1zquez L.: Optimal complexity of secret sharing schemes with four minimal qualified subsets. Des. Codes Cryptogr. Online First (2010). doi: 10.1007\/s10623-010-9446-0 .","DOI":"10.1007\/s10623-010-9446-0"},{"key":"9552_CR29","doi-asserted-by":"crossref","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. 307, 2464\u20132477 (2007)","journal-title":"Discrete Math."},{"key":"9552_CR30","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TIT.2006.887090","volume":"53","author":"F. Mat\u00fa\u0161","year":"2007","unstructured":"Mat\u00fa\u0161 F.: Two constructions on limits of entropy functions. IEEE Trans. Inform. Theory 53, 320\u2013330 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9552_CR31","unstructured":"Metcalf-Burton J.R.: Information Rates of Minimal Non-Matroid-Related Access Structures. http:\/\/arxiv.org\/pdf\/0801.3642 ."},{"key":"9552_CR32","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.disc.2011.01.003","volume":"311","author":"J.R. Metcalf-Burton","year":"2011","unstructured":"Metcalf-Burton J.R.: Improved upper bounds for the information rates of the secret sharing schemes induced by the vamos matroid. Discrete Math. 311, 651\u2013662 (2011)","journal-title":"Discrete Math."},{"key":"9552_CR33","doi-asserted-by":"crossref","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 46, 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9552_CR34","unstructured":"Padr\u00f3 C., V\u00e1zquez L.: Finding lower bounds on the complexity of secret sharing schemes by linear programming. Ninth Latin American Theoretical Informatics Symposium, LATIN 2010, Lecture Notes in Computer Science, vol. 6034, pp. 344\u2013355 (2010)."},{"key":"9552_CR35","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Commun. ACM. 22, 612\u2013613 (1979)","journal-title":"Commun. ACM."},{"key":"9552_CR36","doi-asserted-by":"crossref","unstructured":"Simmons G.J.: How to (really) share a secret. Advances in Cryptology\u2014CRYPTO\u201988, Lecture Notes in Comput. Sci., vol. 403, pp. 390\u2013448 (1990).","DOI":"10.1007\/0-387-34799-2_30"},{"key":"9552_CR37","doi-asserted-by":"crossref","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. 2, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"9552_CR38","doi-asserted-by":"crossref","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 Trans. Inform. Theory 40, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9552_CR39","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T. Tassa","year":"2007","unstructured":"Tassa T.: Hierarchical threshold secret sharing. J. Cryptol. 20, 237\u2013264 (2007)","journal-title":"J. Cryptol."},{"key":"9552_CR40","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T. Tassa","year":"2009","unstructured":"Tassa T., Dyn N.: Multipartite secret sharing by bivariate interpolation. J. Cryptol. 22, 227\u2013258 (2009)","journal-title":"J. Cryptol."},{"key":"9552_CR41","doi-asserted-by":"crossref","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. Des. Codes Cryptogr. 6, 143\u2013169 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9552_CR42","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ipl.2006.01.016","volume":"99","author":"M. Dijk van","year":"2006","unstructured":"van Dijk M., Kevenaar T., Schrijen G., Tuyls P.: Improved constructions of secret sharing schemes by applying (\u03bb, \u03c9)-decompositions. Inform. Process. Lett. 99, 154\u2013157 (2006)","journal-title":"Inform. Process. Lett."},{"key":"9552_CR43","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/18.681320","volume":"44","author":"Z. Zhang","year":"1998","unstructured":"Zhang Z., Yeung R.W.: On characterization of entropy function via information inequalities. IEEE Trans. Inform. Theory 44, 1440\u20131452 (1998)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9552-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9552-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9552-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T15:09:02Z","timestamp":1592838542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9552-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,24]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9552"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9552-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,24]]}}}