{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078298},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T00:00:00Z","timestamp":1381795200000},"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":[[2015,3]]},"DOI":"10.1007\/s10623-013-9888-2","type":"journal-article","created":{"date-parts":[[2013,10,14]],"date-time":"2013-10-14T07:02:54Z","timestamp":1381734174000},"page":"719-729","source":"Crossref","is-referenced-by-count":10,"title":["Secret sharing on the d-dimensional cube"],"prefix":"10.1007","volume":"74","author":[{"given":"L\u00e1szl\u00f3","family":"Csirmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"9888_CR1","doi-asserted-by":"crossref","unstructured":"Beimel A.: Secret-sharing schemes: a survey. In: Coding and Cryptology. Third International Workshop, IWCC 2011. Lecture Notes in Computer Science, vol. 6639, pp. 11\u201346 (2011).","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"9888_CR2","unstructured":"Beimel A., Farr\u00e0s O., Mintz Y.: Secret sharing schemes for very dense graphs. In: Advances in Cryptology (CRYPTO 2012). Lecture Notes in Computer Science, vol. 7417, pp. 144\u2013161 (2012)."},{"key":"9888_CR3","doi-asserted-by":"crossref","unstructured":"Blundo C., De Santis A., Stinson D.R., Vaccaro U.: Graph decomposition and secret sharing schemes. J. Cryptol. 8, 39\u201364 (1995).","DOI":"10.1007\/BF00204801"},{"key":"9888_CR4","doi-asserted-by":"crossref","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).","DOI":"10.1023\/A:1008216403325"},{"key":"9888_CR5","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Davenport D.M.: On the classification of ideal. J. Cryptol. 4, 123\u2013134 (1991).","DOI":"10.1007\/BF00196772"},{"key":"9888_CR6","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Stinson D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptol. 5, 153\u2013166 (1992).","DOI":"10.1007\/BF02451112"},{"key":"9888_CR7","doi-asserted-by":"crossref","unstructured":"Csirmaz L.: Secret sharing schemes on graphs. Stud. Math. Hung. 44, 297\u2013306. Available as IACR preprint. http:\/\/eprint.iacr.org\/2005\/059 (2007). Accessed 1 Oct 2013.","DOI":"10.1556\/SScMath.2007.1021"},{"key":"9888_CR8","unstructured":"Csirmaz L.: Secret sharing on infinite graphs. Tatra Mt. Math. Publ. 41, 1\u201318 (2008)."},{"key":"9888_CR9","doi-asserted-by":"crossref","unstructured":"Csirmaz L., Ligeti P.: On an infinite family of graphs with information ratio $$2-1\/k.$$ 2 - 1 \/ k . Computing 85, 127\u2013136 (2009).","DOI":"10.1007\/s00607-009-0039-6"},{"key":"9888_CR10","unstructured":"Csirmaz L., Tardos G.: Optimal information rate of secret sharing schemes on trees. IEEE Trans. Inf. Theory 59(4), 2527\u20132530 (2013)."},{"key":"9888_CR11","unstructured":"Csisz\u00e1r I., K\u00f6rner J.: Information Theory. Coding Theorems for Discrete Memoryless Systems. Academic Press, New York (1981)."},{"key":"9888_CR12","unstructured":"Erd\u0151s P., Pyber L.: Covering a graph by complete bipartite. Discret. Math. 170, 249\u2013251 (1997)."},{"key":"9888_CR13","doi-asserted-by":"crossref","unstructured":"Jackson W.-A., Martin K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 267\u2013286 (1996).","DOI":"10.1007\/BF00129769"},{"key":"9888_CR14","unstructured":"Padr\u00f3 C.: Lecture notes in secret sharing. Available as IACR preprint. http:\/\/eprint.iacr.org\/2012\/674 . Accessed 1 Oct 2013."},{"key":"9888_CR15","unstructured":"Stinson D.R.: Decomposition construction for secret sharing schemes. IEEE Trans. Inf. Theory 40, 118\u2013125 (1994)."},{"key":"9888_CR16","doi-asserted-by":"crossref","unstructured":"van Dijk M.: On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 6, 143\u2013160 (1995).","DOI":"10.1007\/BF01398012"},{"key":"9888_CR17","unstructured":"Wang W., Li Z., Song Y.: The optimal information rate of perfect secret sharing schemes. In: 2011 International Conference on Business Management and Electronic Information (BMEI), vol. 2, pp. 207\u2013212 (2011)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9888-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9888-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9888-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T23:08:48Z","timestamp":1596668928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9888-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,15]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9888"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9888-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,15]]}}}