{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:52:07Z","timestamp":1763808727134},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_12","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"194-212","source":"Crossref","is-referenced-by-count":30,"title":["Matroids Can Be Far from Ideal Secret Sharing"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Noam","family":"Livne","sequence":"additional","affiliation":[]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","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 Information Theory\u00a040(3), 786\u2013794 (1994)","journal-title":"IEEE Trans. on Information Theory"},{"key":"12_CR2","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":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proc. of the 14th conference on Computer and communications security, pp. 172\u2013184 (2007)","DOI":"10.1145\/1315245.1315268"},{"key":"12_CR4","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)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. of the 1979 AFIPS National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"1","key":"12_CR6","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":"12_CR7","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":"73","key":"12_CR8","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. of Cryptology\u00a04(73), 123\u2013134 (1991)","journal-title":"J. of Cryptology"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","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. of Cryptology\u00a05(3), 153\u2013166 (1992)","journal-title":"J. of Cryptology"},{"issue":"3","key":"12_CR10","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":"2","key":"12_CR11","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":"12_CR12","doi-asserted-by":"crossref","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)"},{"issue":"4","key":"12_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. of Cryptology\u00a010(4), 223\u2013231 (1997)","journal-title":"J. of Cryptology"},{"key":"12_CR14","first-page":"98","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. of the Institute of Combinatorics and its Applications\u00a019, 98\u2013101 (1997)","journal-title":"Bull. of the Institute of Combinatorics and its Applications"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Dougherty, R., Freiling, C., Zeger, K.: Six new non-Shannon information inequalities. In: IEEE International Symposium on Information Theory (ISIT), pp. 233\u2013236 (2006)","DOI":"10.1109\/ISIT.2006.261840"},{"issue":"6","key":"12_CR16","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 Information Theory\u00a053(6), 1949\u20131969 (2007)","journal-title":"IEEE Trans. on Information Theory"},{"key":"12_CR17","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)"},{"key":"12_CR18","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 1987, pp. 99\u2013102 (1987)"},{"key":"12_CR19","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)","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1","key":"12_CR20","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 Information Theory\u00a029(1), 35\u201341 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48285-7_11","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"K. Kurosawa","year":"1994","unstructured":"Kurosawa, K., Okada, K., Sakano, K., Ogata, W., Tsujii, S.: Nonperfect secret sharing schemes and matroids. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 126\u2013141. Springer, Heidelberg (1994)"},{"key":"12_CR22","unstructured":"Livne, N.: On matroids and non-ideal secret sharing. Master\u2019s thesis, Ben-Gurion University, Beer-Sheva (2005)"},{"issue":"1","key":"12_CR23","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. Designs, Codes and Cryptography\u00a034(1), 17\u201334 (2005)","journal-title":"Designs, Codes and Cryptography"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","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. 253\u2013272. Springer, Heidelberg (2007)"},{"key":"12_CR25","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On secret sharing schemes, matroids and polymatroids. Journal version of\u00a0[24]. Technical Report 2006\/077, Cryptology ePrint Archive (2006), http:\/\/eprint.iacr.org\/"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F. Mat\u00fa\u0161","year":"1999","unstructured":"Mat\u00fa\u0161, F.: Matroid representations by partitions. Discrete Mathematics\u00a0203, 169\u2013194 (1999)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"12_CR27","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 Information Theory\u00a053(1), 320\u2013330 (2007)","journal-title":"IEEE Trans. on Information Theory"},{"key":"12_CR28","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1093\/qmath\/27.4.407","volume":"27","author":"P.D. Seymour","year":"1976","unstructured":"Seymour, P.D.: A forbidden minor characterization of matroid ports. Quart. J. Math. Oxford Ser.\u00a027, 407\u2013413 (1976)","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P.D. Seymour","year":"1992","unstructured":"Seymour, P.D.: On secret-sharing matroids. J. of Combinatorial Theory, Series B\u00a056, 69\u201373 (1992)","journal-title":"J. of Combinatorial Theory, Series B"},{"key":"12_CR31","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. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"12_CR32","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"},{"issue":"2","key":"12_CR33","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J. Simonis","year":"1998","unstructured":"Simonis, J., Ashikhmin, A.: Almost affine codes. Designs, Codes and Cryptography\u00a014(2), 179\u2013197 (1998)","journal-title":"Designs, Codes and Cryptography"},{"key":"12_CR34","unstructured":"Vamos, P.: On the representation of independence structures (1968)(unpublished manuscript)"},{"key":"12_CR35","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic press, London (1976)"},{"issue":"4","key":"12_CR36","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 Information Theory\u00a044(4), 1440\u20131452 (1998)","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:14:42Z","timestamp":1606184082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_12","relation":{},"subject":[]}}