{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:08:09Z","timestamp":1725552489659},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_31","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"344-355","source":"Crossref","is-referenced-by-count":3,"title":["Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming"],"prefix":"10.1007","author":[{"given":"Carles","family":"Padr\u00f3","sequence":"first","affiliation":[]},{"given":"Leonor","family":"V\u00e1zquez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Combinatorics of Finite Sets","author":"I. Anderson","year":"1987","unstructured":"Anderson, I.: Combinatorics of Finite Sets. Oxford University Press, Oxford (1987)"},{"key":"31_CR2","volume-title":"Linear Programming and Network Flows","author":"M. Bazaraa","year":"1990","unstructured":"Bazaraa, M., Jarvis, J., Sherali, H.: Linear Programming and Network Flows, 2nd edn. John Wiley& Sons, Chichester (1990)","edition":"2"},{"key":"31_CR3","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":"31_CR4","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":"31_CR5","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":"31_CR6","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":"31_CR7","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":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Benaloh","year":"1990","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 (1990)"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conf. P., vol.\u00a048, pp. 313\u2013317 (1979)","key":"31_CR9","DOI":"10.1109\/MARK.1979.8817296"},{"key":"31_CR10","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 Code Cryptogr.\u00a011, 107\u2013122 (1997)","journal-title":"Design Code Cryptogr."},{"unstructured":"Chan, T.H., Guill\u00e9, L., Grant, A.: The minimal set of Ingleton inequalities (2008), http:\/\/arXiv.org\/abs\/0802.2574","key":"31_CR11"},{"issue":"6-7","key":"31_CR12","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/S0898-1221(01)00328-5","volume":"43","author":"B.-L. Chen","year":"2002","unstructured":"Chen, B.-L., Sun, H.-M.: Weighted Decomposition Construction for Perfect Secret Sharing Schemes. Comput. Math. Appl.\u00a043(6-7), 877\u2013887 (2002)","journal-title":"Comput. Math. Appl."},{"key":"31_CR13","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"},{"unstructured":"Csirmaz, L.: Secret sharing on the d-dimensional cube. Cryptology ePrint Archive. Report 2005\/177 (2005), http:\/\/eprint.iacr.org","key":"31_CR14"},{"key":"31_CR15","doi-asserted-by":"publisher","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. Designs, Codes and Cryptography\u00a053, 195\u2013209 (2009)","journal-title":"Designs, Codes and Cryptography"},{"unstructured":"Csirmaz, L., Tardos, G.: Secret sharing on trees: problem solved. Cryptology ePrint Archive (preprint, 2009), http:\/\/eprint.iacr.org\/2009\/071","key":"31_CR16"},{"key":"31_CR17","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. Des. Codes Cryptogr.\u00a06, 143\u2013169 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0020-0190(97)00086-0","volume":"63","author":"M. Dijk van","year":"1997","unstructured":"van Dijk, M.: More information theoretical inequalities to be used in secret sharing? Inform. Process. Lett.\u00a063, 41\u201344 (1997)","journal-title":"Process. Lett."},{"key":"31_CR19","first-page":"93","volume":"19","author":"M. Dijk van","year":"1997","unstructured":"van Dijk, M., Jackson, W.-A., Martin, K.M.: A note on duality in linear secret sharing schemes. Bull. Inst. Combin. Appl.\u00a019, 93\u2013101 (1997)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"4","key":"31_CR20","doi-asserted-by":"publisher","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.\u00a099 (4), 154\u2013157 (2006)","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Six new non-Shannon information in- equalities. In: ISIT 2006, pp. 233\u2013236 (2006)","key":"31_CR21","DOI":"10.1109\/ISIT.2006.261840"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","first-page":"565","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"S. Fehr","year":"2002","unstructured":"Fehr, S.: Linear VSS and Distributes Commitments Based on Secret Sharing and Pairwise Checks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 565\u2013580. Springer, Heidelberg (2002)"},{"key":"31_CR23","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. Inform. and Control.\u00a039, 55\u201372 (1978)","journal-title":"Inform. and Control."},{"doi-asserted-by":"crossref","unstructured":"Ingleton, A.W.: Conditions for representability and transversability of matroids. In: Proc. Fr. Br. Conf. 1970, pp. 62\u201327 (1971)","key":"31_CR24","DOI":"10.1007\/BFb0061075"},{"unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom 1987, pp. 99\u2013102 (1987)","key":"31_CR25"},{"key":"31_CR26","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":"31_CR27","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.\u00a09, 267\u2013286 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E.D. Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inform. Theory\u00a029, 35\u201341 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR29","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), Cryptology ePrint Archive, http:\/\/eprint.iacr.org\/2006\/077"},{"key":"31_CR30","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TIT.2005.860438","volume":"44","author":"F. Mat\u00fa\u0161","year":"2006","unstructured":"Mat\u00fa\u0161, F.: Piecewise linear conditional information inequality. On IEEE Trans. Inform. Theory\u00a044, 236\u2013238 (2006)","journal-title":"On IEEE Trans. Inform. Theory"},{"key":"31_CR31","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."},{"doi-asserted-by":"crossref","unstructured":"Mat\u00fa\u0161, F.: Infinitely many information inequalities. In: IEEE International Symposium on Information Theory 2007, pp. 41\u201344 (2007)","key":"31_CR32","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"31_CR33","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"},{"key":"31_CR34","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":"31_CR35","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 Trans. Inform. Theory\u00a040, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"doi-asserted-by":"crossref","unstructured":"Yeung, R.: A First Course in Information Theory. Kluwer Academic\/Plenum Publishers (2002)","key":"31_CR36","DOI":"10.1007\/978-1-4419-8608-5"},{"key":"31_CR37","doi-asserted-by":"publisher","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\u00a044, 1440\u20131452 (1998)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:35Z","timestamp":1619784335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}