{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:53Z","timestamp":1757453813589,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004568"},{"type":"electronic","value":"9783642004575"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00457-5_32","type":"book-chapter","created":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T09:59:44Z","timestamp":1235037584000},"page":"539-557","source":"Crossref","is-referenced-by-count":10,"title":["Secret Sharing and Non-Shannon Information Inequalities"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Ilan","family":"Orlov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"32_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(3), 301\u2013319 (1999)","journal-title":"Combinatorica"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A. Beimel","year":"1994","unstructured":"Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Trans. on Info. Theory\u00a040(3), 786\u2013794 (1994)","journal-title":"IEEE Trans. on Info. Theory"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-70936-7_14","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2007","unstructured":"Beimel, A., Franklin, M.: Weakly-private secret sharing schemes. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 253\u2013272. Springer, Heidelberg (2007)"},{"key":"32_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)"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: 14th CCS, pp. 172\u2013184 (2007)","key":"32_CR5","DOI":"10.1145\/1315245.1315268"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th STOC, pp. 1\u201310 (1988)","key":"32_CR6","DOI":"10.1145\/62212.62213"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J.C. Benaloh","year":"1990","unstructured":"Benaloh, J.C., 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: Proc. of the 1979 AFIPS National Computer Conference, pp. 313\u2013317 (1979)","key":"32_CR8","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","volume":"154","author":"C. Blundo","year":"1996","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. Theoretical Computer Science\u00a0154(2), 283\u2013306 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(97)00194-4","volume":"65","author":"C. Blundo","year":"1998","unstructured":"Blundo, C., De Santis, A., Vaccaro, U.: On secret sharing schemes. Inform. Process. Lett.\u00a065(1), 25\u201332 (1998)","journal-title":"Inform. Process. Lett."},{"key":"32_CR11","first-page":"105","volume":"6","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combin. Math. and Combin. Comput.\u00a06, 105\u2013113 (1989)","journal-title":"Journal of Combin. Math. and Combin. Comput."},{"issue":"3","key":"32_CR12","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. of Cryptology\u00a06(3), 157\u2013168 (1993)","journal-title":"J. of Cryptology"},{"issue":"7","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1992","DOI":"10.1109\/TIT.2002.1013138","volume":"48","author":"T.H. Chan","year":"2002","unstructured":"Chan, T.H., Yeung, R.W.: On a relation between information inequalities and group theory. IEEE Trans. on Info. Theory\u00a048(7), 1992\u20131995 (2002)","journal-title":"IEEE Trans. on Info. Theory"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11\u201319 (1988)","key":"32_CR14","DOI":"10.1145\/62212.62214"},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02620136","volume":"6","author":"B. Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: Secret sharing over infinite domains. J. of Cryptology\u00a06(2), 87\u201396 (1993)","journal-title":"J. of Cryptology"},{"key":"32_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0053420","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"L. Csirmaz","year":"1995","unstructured":"Csirmaz, L.: The size of a share must be large. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 13\u201322. Springer, Heidelberg (1995)"},{"issue":"3\u20134","key":"32_CR19","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.\u00a032(3\u20134), 429\u2013437 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"Y.G. Desmedt","year":"1992","unstructured":"Desmedt, Y.G., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 457\u2013469. Springer, Heidelberg (1992)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BFb0053421","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Dijk van","year":"1995","unstructured":"van Dijk, M.: A linear construction of perfect secret sharing schemes. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 23\u201334. Springer, Heidelberg (1995)"},{"key":"32_CR22","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. Designs, Codes and Cryptography\u00a06, 143\u2013169 (1995)","journal-title":"Designs, Codes and Cryptography"},{"doi-asserted-by":"crossref","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Six new non-Shannon information inequalities. In: ISIT 2006, pp. 233\u2013236 (2006)","key":"32_CR23","DOI":"10.1109\/ISIT.2006.261840"},{"issue":"6","key":"32_CR24","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1109\/TIT.2007.896862","volume":"53","author":"R. Dougherty","year":"2007","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Networks, matroids, and non-Shannon information inequalities. IEEE Trans. on Info. Theory\u00a053(6), 1949\u20131969 (2007)","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"1\u20133","key":"32_CR25","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(1\u20133), 55\u201372 (1978)","journal-title":"Information and Control"},{"issue":"4","key":"32_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A. G\u00e1l","year":"2002","unstructured":"G\u00e1l, A.: A characterization of span program size and improved lower bounds for monotone span programs. Computational Complexity\u00a010(4), 277\u2013296 (2002)","journal-title":"Computational Complexity"},{"doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: 13th CCS, pp. 89\u201398 (2006)","key":"32_CR27","DOI":"10.1145\/1180405.1180418"},{"unstructured":"Guille, L., Chan, T.H., Grant, A.: The minimal set of Ingleton inequalities. Technical Report 0802.2574, arxiv.org (2008), http:\/\/arxiv.org\/abs\/0802.2574","key":"32_CR28"},{"key":"32_CR29","first-page":"62","volume-title":"Proc. Fr. Br. Conf. 1970","author":"A.W. Ingleton","year":"1971","unstructured":"Ingleton, A.W.: Conditions for representability and transversability of matroids. In: Proc. Fr. Br. Conf. 1970, pp. 62\u201367. Springer, Heidelberg (1971)"},{"unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Globecom 1987, pp. 99\u2013102 (1987)","key":"32_CR30"},{"doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102\u2013111 (1993)","key":"32_CR31","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1","key":"32_CR32","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. on Info. Theory\u00a029(1), 35\u201341 (1983)","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"2","key":"32_CR33","doi-asserted-by":"publisher","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. Communications in Information and Systems\u00a02(2), 147\u2013166 (2002)","journal-title":"Communications in Information and Systems"},{"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":"32_CR34","DOI":"10.1109\/ISIT.2007.4557201"},{"issue":"1","key":"32_CR35","doi-asserted-by":"publisher","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. on Info. Theory\u00a053(1), 320\u2013330 (2007)","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"1","key":"32_CR36","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/71.722223","volume":"9","author":"M. Naor","year":"1998","unstructured":"Naor, M., Wool, A.: Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems\u00a09(1), 909\u2013922 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"32_CR37","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: Proc. of the 24th IEEE Symp. on Foundations of Computer Science, pp. 403\u2013409 (1983)","key":"32_CR38","DOI":"10.1109\/SFCS.1983.48"},{"unstructured":"Riis, S.: Graph entropy, network coding and guessing games. Technical Report 0711.4175, arxiv.org (2007), http:\/\/arxiv.org\/abs\/0711.4175","key":"32_CR39"},{"key":"32_CR40","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. Comm. of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Comm. of the ACM"},{"issue":"4","key":"32_CR41","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"32_CR42","first-page":"71","volume":"1","author":"G.J. Simmons","year":"1991","unstructured":"Simmons, G.J., Jackson, W., Martin, K.M.: The geometry of shared secret schemes. Bulletin of the ICA\u00a01, 71\u201388 (1991)","journal-title":"Bulletin of the ICA"},{"unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. Technical Report 2008\/290, Cryptology ePrint Archive (2008), http:\/\/eprint.iacr.org\/","key":"32_CR43"},{"doi-asserted-by":"crossref","unstructured":"Xu, W., Wang, J., Sun, J.: A projection method for derivation of non-Shannon-type information inequalities. In: ISIT 2008, pp. 2116\u20132120 (2008)","key":"32_CR44","DOI":"10.1109\/ISIT.2008.4595363"},{"key":"32_CR45","volume-title":"A First Course in Information Theory","author":"R.W. Yeung","year":"2006","unstructured":"Yeung, R.W.: A First Course in Information Theory. Springer, Heidelberg (2006)"},{"issue":"1","key":"32_CR46","doi-asserted-by":"publisher","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. Communications in Information and Systems\u00a03(1), 47\u201360 (2003)","journal-title":"Communications in Information and Systems"},{"issue":"4","key":"32_CR47","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. on Info. Theory\u00a044(4), 1440\u20131452 (1998)","journal-title":"IEEE Trans. on Info. Theory"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00457-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T20:26:09Z","timestamp":1738959969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00457-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004568","9783642004575"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00457-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}