{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:59:26Z","timestamp":1764997166080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319783802"},{"type":"electronic","value":"9783319783819"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78381-9_22","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T05:53:14Z","timestamp":1522389194000},"page":"597-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing"],"prefix":"10.1007","author":[{"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarik","family":"Kaced","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e0","family":"Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"key":"22_CR1","unstructured":"Ahlswede, R., K\u00f6rner, J.: On the connection between the entropies of input and output distributions of discrete memoryless channels. In: Proceedings of the 5th Brasov Conference on Probability Theory, Brasov, Editura Academiei, Bucuresti, pp. 13\u201323 (1977)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/11889342_41","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., K\u00f6rner, J.: Appendix: on common information and related characteristics of correlated information sources. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 664\u2013677. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_41"},{"key":"22_CR3","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 19, 301\u2013319 (1999)","journal-title":"Combinatorica"},{"key":"22_CR4","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. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/s00145-014-9195-8","volume":"29","author":"A Beimel","year":"2016","unstructured":"Beimel, A., Farr\u00e0s, O., Mintz, Y.: Secret-sharing schemes for very dense graphs. J. Cryptol. 29, 336\u2013362 (2016)","journal-title":"J. Cryptol."},{"key":"22_CR6","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. Complex. 6, 29\u201345 (1997)","journal-title":"Comput. Complex."},{"key":"22_CR7","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. 4948, pp. 194\u2013212. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_12"},{"key":"22_CR8","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 57, 5634\u20135649 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"22_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. Des. Codes Cryptogr. 11, 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"EF 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":"22_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"RM Capocelli","year":"1993","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. Cryptol. 6, 157\u2013167 (1993)","journal-title":"J. Cryptol."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/S0898-1221(01)00328-5","volume":"43","author":"BL Chen","year":"2002","unstructured":"Chen, B.L., Sun, H.M.: Weighted decomposition construction for perfect secret sharing schemes. Comput. Math. Appl. 43, 877\u2013887 (2002)","journal-title":"Comput. Math. Appl."},{"key":"22_CR14","first-page":"429","volume":"32","author":"L Csirmaz","year":"1996","unstructured":"Csirmaz, L.: The dealer\u2019s random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar. 32, 429\u2013437 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"key":"22_CR15","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. Cryptol. 10, 223\u2013231 (1997)","journal-title":"J. Cryptol."},{"key":"22_CR16","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. 53, 195\u2013209 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10623-013-9888-2","volume":"74","author":"L Csirmaz","year":"2015","unstructured":"Csirmaz, L.: Secret sharing on the $$d$$-dimensional cube. Des. Codes Cryptogr. 74, 719\u2013729 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1109\/TIT.2012.2236958","volume":"59","author":"L Csirmaz","year":"2013","unstructured":"Csirmaz, L., Tardos, G.: Optimal information rate of secret sharing schemes on trees. IEEE Trans. Inf. Theory 59, 2527\u20132530 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR19","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csiszar","year":"1981","unstructured":"Csiszar, I., K\u00f6rner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, Akademiai Kiado, New York, Budapest (1981)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M van Dijk","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":"22_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0020-0190(97)00086-0","volume":"63","author":"M van Dijk","year":"1997","unstructured":"van Dijk, M.: More information theoretical inequalities to be used in secret sharing? Inf. Process. Lett. 63, 41\u201344 (1997)","journal-title":"Inf. Process. Lett."},{"key":"22_CR22","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":"22_CR23","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Linear rank inequalities on five or more variables. arXiv.org, arXiv:0910.0284v3 (2009)"},{"key":"22_CR24","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Non-Shannon information inequalities in four random variables. arXiv.org, arXiv:1104.3602v1 (2011)"},{"key":"22_CR25","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. 63, 255\u2013271 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR26","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. Inf. Control 39, 55\u201372 (1978)","journal-title":"Inf. Control"},{"key":"22_CR27","first-page":"14","volume":"61","author":"S Fujishige","year":"1978","unstructured":"Fujishige, S.: Entropy functions and polymatroids-combinatorial structures in information theory. Electron. Comm. Japan 61, 14\u201318 (1978)","journal-title":"Electron. Comm. Japan"},{"key":"22_CR28","first-page":"149","volume":"2","author":"P G\u00e1cs","year":"1973","unstructured":"G\u00e1cs, P., K\u00f6rner, J.: Common information is far less than mutual information. Probl. Control Inf. Theory 2, 149\u2013162 (1973)","journal-title":"Probl. Control Inf. Theory"},{"key":"22_CR29","unstructured":"Gharahi, M: On the complexity of perfect secret sharing schemes. Ph.D. Thesis, Iran University of Science and Technology (2013) (in Persian)"},{"key":"22_CR30","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10623-011-9592-z","volume":"67","author":"M Gharahi","year":"2013","unstructured":"Gharahi, M., Dehkordi, M.H.: The complexity of the graph access structures on six participants. Des. Codes Cryptogr. 67, 169\u2013173 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR31","doi-asserted-by":"publisher","first-page":"311","DOI":"10.3934\/amc.2013.7.311","volume":"7","author":"M Gharahi","year":"2013","unstructured":"Gharahi, M., Dehkordi, M.H.: Average complexities of access structures on five participants. Adv. Math. Commun. 7, 311\u2013317 (2013)","journal-title":"Adv. Math. Commun."},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Gharahi, M., Dehkordi, M.H: Perfect secret sharing schemes for graph access structures on six participants. J. Math. Cryptol. 7, 143\u2013146 (2013)","DOI":"10.1515\/jmc-2012-0026"},{"key":"22_CR33","unstructured":"Gharahi, M., Khazaei, S.: Optimal linear secret sharing schemes for graph access structures on six participants. Cryptology ePrint Archive: Report 2017\/1232 (2017)"},{"key":"22_CR34","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. J. Comput. Syst. Sci. 60, 442\u2013464 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR35","first-page":"149","volume-title":"Combinatorial Mathematics and its Applications","author":"AW 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":"22_CR36","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"WA 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":"22_CR37","first-page":"267","volume":"9","author":"WA 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":"22_CR38","doi-asserted-by":"crossref","unstructured":"Kaced, T.: Equivalence of two proof techniques for non-Shannon inequalities. arXiv:1302.2994 (2013)","DOI":"10.1109\/ISIT.2013.6620223"},{"key":"22_CR39","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"ED Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29, 35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR40","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.jcta.2009.10.014","volume":"118","author":"RJ Kinser","year":"2011","unstructured":"Kinser, R.J.: New inequalities for subspace arrangements. Combin. Theory Ser. A 118, 152\u2013161 (2011)","journal-title":"Combin. Theory Ser. A"},{"key":"22_CR41","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10623-013-9879-3","volume":"74","author":"Q Li","year":"2015","unstructured":"Li, Q., Li, X.X., Lai, X.J., Chen, K.F.: Optimal assignment schemes for general access structures based on linear programming. Des. Codes Cryptogr. 74, 623\u2013644 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR42","doi-asserted-by":"crossref","first-page":"147","DOI":"10.4310\/CIS.2002.v2.n2.a3","volume":"2","author":"K Makarychev","year":"2002","unstructured":"Makarychev, K., Makarychev, Y., Romashchenko, A., Vereshchagin, N.: A new class of non-Shannon-type inequalities for entropies. Commun. Inf. Syst. 2, 147\u2013166 (2002)","journal-title":"Commun. Inf. Syst."},{"key":"22_CR43","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10623-003-4192-1","volume":"34","author":"J Mart\u00ed-Farr\u00e9","year":"2005","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes with three or four minimal qualified subsets. Des. Codes Cryptogr. 34, 17\u201334 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR44","doi-asserted-by":"publisher","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":"22_CR45","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-010-9446-0","volume":"61","author":"J Mart\u00ed-Farr\u00e9","year":"2011","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. 61, 167\u2013186 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"22_CR46","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TIT.2015.2500232","volume":"62","author":"S Mart\u00edn","year":"2016","unstructured":"Mart\u00edn, S., Padr\u00f3, C., Yang, A.: Secret sharing, rank inequalities, and information inequalities. IEEE Trans. Inform. Theory 62, 599\u2013609 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"22_CR47","doi-asserted-by":"crossref","unstructured":"Mat\u00fa\u0161, F.: Infinitely many information inequalities. In: Proceedings of the IEEE International Symposium on Information Theory, (ISIT), pp. 2101\u20132105 (2007)","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"22_CR48","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.disc.2011.01.003","volume":"311","author":"JR 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. Discret. Math. 311, 651\u2013662 (2011)","journal-title":"Discret. Math."},{"key":"22_CR49","unstructured":"Oxley, J.G: Matroid Theory. Oxford Science Publications, The Clarendon Press, Oxford University Press, New York (1992)"},{"key":"22_CR50","unstructured":"Padr\u00f3, C.: Lecture Notes in secret sharing. Cryptology ePrint Archive, Report 2012\/674 (2912)"},{"key":"22_CR51","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 46, 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"22_CR52","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. Discret. Appl. Math. 161, 1072\u20131084 (2013)","journal-title":"Discret. Appl. Math."},{"key":"22_CR53","doi-asserted-by":"crossref","unstructured":"Pitassi T., Robere R., Lifting Nullstellensatz to Monotone Span Programs over any Field. Electronic Colloquium on Computational Complexity (ECCC), vol. 165 (2017)","DOI":"10.1145\/3188745.3188914"},{"issue":"7","key":"22_CR54","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"3","author":"R Rado","year":"1957","unstructured":"Rado, R.: Note on independence functions. Proc. Lond. Math. Soc. 3(7), 300\u2013320 (1957)","journal-title":"Proc. Lond. Math. Soc."},{"key":"22_CR55","doi-asserted-by":"crossref","unstructured":"Robere, R., Pitassi, T., Rossman, B., Cook, S.A.: Exponential lower bounds for monotone span programs. In: FOCS 2016, pp. 406\u2013415 (2016)","DOI":"10.1109\/FOCS.2016.51"},{"key":"22_CR56","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1093\/qmath\/27.4.407","volume":"27","author":"PD Seymour","year":"1976","unstructured":"Seymour, P.D.: A forbidden minor characterization of matroid ports. Quart. J. Math. Oxf. Ser. 27, 407\u2013413 (1976)","journal-title":"Quart. J. Math. Oxf. Ser."},{"key":"22_CR57","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"PD Seymour","year":"1992","unstructured":"Seymour, P.D.: On secret-sharing matroids. J. Combin. Theory Ser. B 56, 69\u201373 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"22_CR58","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. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"22_CR59","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR 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":"22_CR60","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition constructions for secret-sharing schemes. IEEE Trans. Inf. Theory 40, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR61","doi-asserted-by":"publisher","first-page":"3540","DOI":"10.1109\/TIT.2017.2681078","volume":"63","author":"S Thakor","year":"2017","unstructured":"Thakor, S., Chan, T., Grant, A.: Capacity bounds for networks with correlated sources and characterisation of distributions by entropies. IEEE Trans. Inf. Theory 63, 3540\u20133553 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR62","doi-asserted-by":"crossref","unstructured":"Tian, C.: Characterizing the Rate Region of the $$(4,3,3)$$ Exact-Repair Regenerating Codes. arXiv.org, arXiv:1312.0914 (2013)","DOI":"10.1109\/ISIT.2013.6620462"},{"key":"22_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8608-5","volume-title":"A First Course in Information Theory","author":"RW Yeung","year":"2002","unstructured":"Yeung, R.W.: A First Course in Information Theory. Kluwer Academic\/Plenum Publishers, New York (2002)"},{"key":"22_CR64","volume-title":"Information Theory and Network Coding","author":"RW Yeung","year":"2008","unstructured":"Yeung, R.W.: Information Theory and Network Coding. Springer, Boston (2008)"},{"key":"22_CR65","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. 3, 47\u201360 (2003)","journal-title":"Commun. Inf. Syst."},{"key":"22_CR66","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. Inf. Theory 44, 1440\u20131452 (1998)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78381-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:21:26Z","timestamp":1710267686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78381-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319783802","9783319783819"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78381-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tel Aviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}