{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T21:58:53Z","timestamp":1764194333496,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s12095-018-0338-x","type":"journal-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T04:30:49Z","timestamp":1540441849000},"page":"399-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Secret sharing on large girth graphs"],"prefix":"10.1007","volume":"11","author":[{"given":"L\u00e1szl\u00f3","family":"Csirmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3998-0515","authenticated-orcid":false,"given":"P\u00e9ter","family":"Ligeti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., et al. (eds.) Coding and Cryptology, IWCC 2011 LNCS, vol. 6639, Springer (2011)","key":"338_CR1","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"338_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C Blundo","year":"1995","unstructured":"Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Graph decomposition and secret sharing schemes. J. Crypt. 8, 39\u201364 (1995)","journal-title":"J. Crypt."},{"issue":"2","key":"338_CR3","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 Crypt. 11(2), 107\u2013110 (1997)","journal-title":"Des. Codes Crypt."},{"key":"338_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"EF Brickell","year":"1992","unstructured":"Brickell, E.F., Stinson, D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. J. Crypt. 5, 153\u2013166 (1992)","journal-title":"J. Crypt."},{"issue":"4","key":"338_CR5","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. Crypt. 10(4), 223\u2013231 (1997)","journal-title":"J. Crypt."},{"key":"338_CR6","first-page":"297","volume":"44","author":"L Csirmaz","year":"2007","unstructured":"Csirmaz, L.: Secret sharing schemes on graphs. Studia Math. Hung. 44, 297\u2013306 (2007)","journal-title":"Studia Math. Hung."},{"issue":"1","key":"338_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00607-009-0039-6","volume":"85","author":"L Csirmaz","year":"2009","unstructured":"Csirmaz, L., Ligeti, P.: On an infinite family of graphs with information ratio 2 \u2212 1\/k. Computing 85(1), 127\u2013136 (2009)","journal-title":"Computing"},{"issue":"5","key":"338_CR8","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1007\/s00373-014-1448-7","volume":"31","author":"L Csirmaz","year":"2015","unstructured":"Csirmaz, L., Ligeti, P., Tardos, G.: Erdos-pyber theorem for hypergraphs and secret sharing. Graphs and Combinatorics 31(5), 1335\u20131346 (2015)","journal-title":"Graphs and Combinatorics"},{"issue":"4","key":"338_CR9","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(4), 2527\u20132530 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"338_CR10","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. Des. Codes Crypt. 6(2), 143\u2013169 (1995)","journal-title":"Des. Codes Crypt."},{"unstructured":"Erdos, P., Lovasz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets, volume 11 of Colloq. Math. Soc. J. Bolyai, pp. 609\u2013627 (1975)","key":"338_CR11"},{"issue":"1-3","key":"338_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0012-365X(96)00124-0","volume":"170","author":"P Erdos","year":"1997","unstructured":"Erdos, P., Pyber, L.: Covering a graph by complete bipartite graphs. Disc. Math. 170(1-3), 249\u2013251 (1997)","journal-title":"Disc. Math."},{"issue":"1","key":"338_CR13","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition construction for secret sharing schemes. IEEE Trans. Inf. Theory 40(1), 118\u2013125 (1994)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0338-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0338-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0338-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T16:58:38Z","timestamp":1572022718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0338-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["338"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0338-x","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"10 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}