{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:13Z","timestamp":1772283673614,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,6,9]],"date-time":"2009-06-09T00:00:00Z","timestamp":1244505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10623-009-9304-0","type":"journal-article","created":{"date-parts":[[2009,6,8]],"date-time":"2009-06-08T13:18:43Z","timestamp":1244467123000},"page":"195-209","source":"Crossref","is-referenced-by-count":25,"title":["An impossibility result on graph secret sharing"],"prefix":"10.1007","volume":"53","author":[{"given":"L\u00e1szl\u00f3","family":"Csirmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,9]]},"reference":[{"key":"9304_CR1","doi-asserted-by":"crossref","unstructured":"Beimel A., Livne N., Padr\u00f3 C.: Matroids can be far from ideal secret sharing. In: Proceedings of TCC\u201908, LNCS, vol. 4948, pp. 194\u2013212 (2008).","DOI":"10.1007\/978-3-540-78524-8_12"},{"key":"9304_CR2","doi-asserted-by":"crossref","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. 19, 258\u2013280 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"9304_CR3","doi-asserted-by":"crossref","unstructured":"Beimel A., Livne N.: On matroids and non-ideal secret sharing. In: Halevi S., Rabin T. (eds.) Proceedings of the Third Theory of Cryptography Conference\u2014TCC 2006, LNCS, vol. 3876, pp. 482\u2013501 (2006).","DOI":"10.1007\/11681878_25"},{"key":"9304_CR4","doi-asserted-by":"crossref","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. 34, 1196\u20131215 (2005)","journal-title":"SIAM J. Comput."},{"key":"9304_CR5","doi-asserted-by":"crossref","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313\u2013317 (1979).","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9304_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C. Blundo","year":"1997","unstructured":"Blundo C., De Santis A., Simone R.D., Vaccaro U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11, 107\u2013110 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"9304_CR7","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 9, 105\u2013113 (1989)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"3","key":"9304_CR8","doi-asserted-by":"crossref","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 of secret sharing schemes. J. Cryptology 6(3), 157\u2013168 (1993)","journal-title":"J. Cryptology"},{"key":"9304_CR9","doi-asserted-by":"crossref","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. Cryptology 6, 87\u201396 (1993)","journal-title":"J. Cryptology"},{"issue":"4","key":"9304_CR10","doi-asserted-by":"crossref","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 10(4), 223\u2013231 (1997)","journal-title":"J. Cryptology"},{"key":"9304_CR11","doi-asserted-by":"crossref","unstructured":"Csirmaz L.: Secret sharing schemes on graphs. Studia Sci. Math. Hungar. 44, 297\u2013306 (2007)\u2014available as IACR preprint http:\/\/eprint.iacr.org\/2005\/059 .","DOI":"10.1556\/SScMath.2007.1021"},{"key":"9304_CR12","unstructured":"Csirmaz L., Ligeti P.: On an infinite families of graphs with information ratio 2 \u2212 1\/k (Special Issue of Computing on the occasion CECC\u201908 to appear)."},{"key":"9304_CR13","volume-title":"Information Theory. Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1981","unstructured":"Csisz\u00e1r I., K\u00f6rner J.: Information Theory. Coding Theorems for Discrete Memoryless Systems. Academic Press, New York (1981)"},{"key":"9304_CR14","unstructured":"Ferr\u00e1s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. In: Advances in Cryptology\u2014EUROCRYPT 2007, LNCS, vol. 4515, pp. 448\u2013465 (2007)."},{"key":"9304_CR15","doi-asserted-by":"crossref","unstructured":"Ingleton A.W.: Conditions for representability and transversability of matroids. In: Proc. Fr. Br. Conf. 1970, pp. 62\u201327. Springer-Verlag (1971).","DOI":"10.1007\/BFb0061075"},{"key":"9304_CR16","first-page":"233","volume":"9","author":"W. Jackson","year":"1996","unstructured":"Jackson W., Martin K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 233\u2013250 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"9304_CR17","unstructured":"Karchmer M., Widgerson A.: On span programs. In: Proc. of the 8th IEEE Trans. on Information Theory, vol. 29, pp. 102\u2013111 (1993)."},{"key":"9304_CR18","doi-asserted-by":"crossref","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":"9304_CR19","doi-asserted-by":"crossref","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On secret sharing schemes, matroids and polymatroids. In: TCC 2007, Lecture Notes in Comput. Sci., vol. 4392, pp. 273\u2013290 (2007).","DOI":"10.1007\/978-3-540-70936-7_15"},{"key":"9304_CR20","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F. Matus","year":"1999","unstructured":"Matus F.: Matroid representations by partitions. Discrete Math. 203, 169\u2013194 (1999)","journal-title":"Discrete Math."},{"issue":"21","key":"9304_CR21","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1016\/j.disc.2006.11.013","volume":"307","author":"F. Matus","year":"2007","unstructured":"Matus F.: Adhesivity of polymatroids. Discrete Math. 307(21), 2464\u20132477 (2007)","journal-title":"Discrete Math."},{"key":"9304_CR22","doi-asserted-by":"crossref","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":"9304_CR23","doi-asserted-by":"crossref","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 40, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9304_CR24","first-page":"143","volume":"12","author":"M. Dijk van","year":"1997","unstructured":"van Dijk M.: On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 12, 143\u2013169 (1997)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"9304_CR25","doi-asserted-by":"crossref","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. 99(4), 154\u2013157 (2006)","journal-title":"Inform. Process. Lett."},{"key":"9304_CR26","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh D.J.A.: Matroid Theory. Academic Press, London (1976)"},{"key":"9304_CR27","doi-asserted-by":"crossref","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 44, 1440\u20131452 (1998)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9304-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9304-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9304-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T11:09:57Z","timestamp":1589886597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9304-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9304"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9304-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,9]]}}}