{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:38:31Z","timestamp":1725745111411},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400834"},{"type":"electronic","value":"9783642400841"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40084-1_16","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T09:56:37Z","timestamp":1376474197000},"page":"277-288","source":"Crossref","is-referenced-by-count":3,"title":["Secret Sharing, Rank Inequalities and Information Inequalities"],"prefix":"10.1007","author":[{"given":"Sebasti\u00e0","family":"Mart\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930050058","volume":"19","author":"L. Babai","year":"1999","unstructured":"Babai, L., G\u00e1l, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica\u00a019, 301\u2013319 (1999)","journal-title":"Combinatorica"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A. Beimel","year":"2011","unstructured":"Beimel, A.: Secret-Sharing Schemes: A Survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01202040","volume":"6","author":"A. Beimel","year":"1997","unstructured":"Beimel, A., G\u00e1l, A., Paterson, M.: Lower bounds for monotone span programs. Comput. Complexity\u00a06, 29\u201345 (1997)","journal-title":"Comput. Complexity"},{"key":"16_CR4","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":"16_CR5","doi-asserted-by":"publisher","first-page":"5634","DOI":"10.1109\/TIT.2011.2162183","volume":"57","author":"A. Beimel","year":"2011","unstructured":"Beimel, A., Orlov, I.: Secret Sharing and Non-Shannon Information Inequalities. IEEE Trans. Inform. Theory\u00a057, 5634\u20135649 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR6","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":"16_CR7","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. Des. Codes Cryptogr.\u00a011, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"16_CR8","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. J. Cryptology\u00a06, 157\u2013167 (1993)","journal-title":"J. Cryptology"},{"key":"16_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. J. Cryptology\u00a010, 223\u2013231 (1997)","journal-title":"J. Cryptology"},{"key":"16_CR10","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. Des. Codes Cryptogr.\u00a053, 195\u2013209 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Six new non-Shannon information inequalities. In: 2006 IEEE International Symposium on Information Theory, pp. 233\u2013236 (2006)","DOI":"10.1109\/ISIT.2006.261840"},{"key":"16_CR12","first-page":"0910","volume":"arXiv","author":"R. Dougherty","year":"2009","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Linear rank inequalities on five or more variables. Available at arXiv.org, arXiv:0910.0284v3 (2009)","journal-title":"Available at arXiv.org"},{"key":"16_CR13","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Non-Shannon Information Inequalities in Four Random Variables. Available at arXiv.org, arXiv:1104.3602v1 (2011)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10623-011-9552-7","volume":"63","author":"O. Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s, O., Metcalf-Burton, J.R., Padr\u00f3, C., V\u00e1zquez, L.: On the Optimization of Bipartite Secret Sharing Schemes. Des. Codes Cryptogr.\u00a063, 255\u2013271 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"16_CR15","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":"16_CR16","first-page":"14","volume":"61","author":"S. Fujishige","year":"1978","unstructured":"Fujishige, S.: Entropy functions and polymatroids\u2014combinatorial structures in information theory. Electron. Comm. Japan\u00a061, 14\u201318 (1978)","journal-title":"Electron. Comm. Japan"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A. G\u00e1l","year":"2001","unstructured":"G\u00e1l, A.: A characterization of span program size and improved lower bounds for monotone span programs. Comput. Complexity\u00a010, 277\u2013296 (2001)","journal-title":"Comput. Complexity"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.1999.1677","volume":"60","author":"D. Hammer","year":"2000","unstructured":"Hammer, D., Romashchenko, A.E., Shen, A., Vereshchagin, N.K.: Inequalities for Shannon entropy and Kolmogorov complexity. Journal of Computer and Systems Sciences\u00a060, 442\u2013464 (2000)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"16_CR19","first-page":"149","volume-title":"Combinatorial Mathematics and its Applications","author":"A.W. Ingleton","year":"1971","unstructured":"Ingleton, A.W.: Representation of matroids. In: Welsh, D.J.A. (ed.) Combinatorial Mathematics and its Applications, pp. 149\u2013167. Academic Press, London (1971)"},{"key":"16_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":"16_CR21","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":"16_CR22","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.jcta.2009.10.014","volume":"118","author":"R. Kinser","year":"2011","unstructured":"Kinser, R.: New inequalities for subspace arrangements. J. Combin. Theory Ser. A.\u00a0118, 152\u2013161 (2011)","journal-title":"J. Combin. Theory Ser. A."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Mat\u00fa\u0161, F.: Infinitely many information inequalities. In: Proc. IEEE International Symposium on Information Theory, ISIT, pp. 2101\u20132105 (2007)","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"16_CR24","doi-asserted-by":"publisher","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 V\u00e1mos matroid. Discrete Math.\u00a0311, 651\u2013662 (2011)","journal-title":"Discrete Math."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.dam.2012.10.020","volume":"161","author":"C. Padr\u00f3","year":"2013","unstructured":"Padr\u00f3, C., V\u00e1zquez, L., Yang, A.: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. Discrete Applied Mathematics\u00a0161, 1072\u20131084 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR26","series-title":"Polyhedra and efficiency","volume-title":"Combinatorial optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin (2003)"},{"key":"16_CR27","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":"16_CR28","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)"},{"key":"16_CR29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.4310\/CIS.2003.v3.n1.a4","volume":"3","author":"Z. Zhang","year":"2003","unstructured":"Zhang, Z.: On a new non-Shannon type information inequality. Commun. Inf. Syst.\u00a03, 47\u201360 (2003)","journal-title":"Commun. Inf. Syst."},{"key":"16_CR30","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","Advances in Cryptology \u2013 CRYPTO 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40084-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T18:56:25Z","timestamp":1646333785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40084-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400834","9783642400841"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40084-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}