{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T08:40:07Z","timestamp":1751791207250,"version":"3.41.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["H2020-ICT-2014-1-644024"],"award-info":[{"award-number":["H2020-ICT-2014-1-644024"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2016-80250-R","TIN2014-57364-C2-1-R"],"award-info":[{"award-number":["TIN2016-80250-R","TIN2014-57364-C2-1-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2015-70054-REDC"],"award-info":[{"award-number":["TIN2015-70054-REDC"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003030","name":"Ag\u00e8ncia de Gesti\u00f3 d\u2019Ajuts Universitaris i de Recerca","doi-asserted-by":"publisher","award":["SGR2014-00537"],"award-info":[{"award-number":["SGR2014-00537"]}],"id":[{"id":"10.13039\/501100003030","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10623-018-0529-7","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T14:57:09Z","timestamp":1533826629000},"page":"1323-1344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Local bounds for the optimal information ratio of secret sharing schemes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7495-5980","authenticated-orcid":false,"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6329-7380","authenticated-orcid":false,"given":"Jordi","family":"Ribes-Gonz\u00e1lez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0842-4951","authenticated-orcid":false,"given":"Sara","family":"Ricci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"529_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon N., Spencer J.H.: The Probabilistic Method, 3rd edn. John Wiley & Sons, New York (2008).","edition":"3"},{"issue":"3","key":"529_CR2","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 19(3), 301\u2013319 (1999).","journal-title":"Combinatorica"},{"key":"529_CR3","doi-asserted-by":"crossref","unstructured":"Beimel A.: Secret-sharing schemes: a survey. In: Third International Workshop on Coding and Cryptology (IWCC 2011). Lecture Notes in Computer Science, vol. 6639, pp. 11\u201346 (2011).","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"529_CR4","doi-asserted-by":"publisher","first-page":"5634","DOI":"10.1109\/TIT.2011.2162183","volume":"57","author":"A Beimel","year":"2011","unstructured":"Beimel A., Orlov I.: Secret sharing and non-Shannon information inequalities. IEEE Trans. Inf. Theory 57, 5634\u20135649 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"529_CR5","doi-asserted-by":"crossref","unstructured":"Beimel A., G\u00e1l A., Paterson M.: Lower bounds for monotone span programs. In: 36th Annual Symposium on Foundations of Computer Science (STOC), pp. 674\u2013681 (1995).","DOI":"10.1109\/SFCS.1995.492669"},{"issue":"2","key":"529_CR6","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/s00145-014-9195-8","volume":"29","author":"A Beimel","year":"2016","unstructured":"Beimel A., Farr\u00e0s O., Mintz Y.: Secret sharing schemes for very dense graphs. J. Cryptol. 29(2), 336\u2013362 (2016).","journal-title":"J. Cryptol."},{"key":"529_CR7","doi-asserted-by":"crossref","unstructured":"Beimel A., Farr\u00e0s O., Peter N.: Schemes secret sharing, for dense forbidden graphs. In: Security and Cryptography for Networks (SCN 2016). Lecture Notes in Computer Science, vol. 9841, pp. 509\u2013528 (2016)","DOI":"10.1007\/978-3-319-44618-9_27"},{"key":"529_CR8","unstructured":"Beimel A., Farr\u00e0s O., Mintz Y., Peter N.: Theory of Cryptography (TCC 2017). Lecture Notes in Computer Science, vol. 10678, pp. 394\u2013423 (2017)."},{"key":"529_CR9","doi-asserted-by":"crossref","unstructured":"Bellare M., Rogaway P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security (CCS 2007), pp. 172\u2013184 (2007).","DOI":"10.1145\/1315245.1315268"},{"key":"529_CR10","unstructured":"Benaloh J., Leichter J.: Generalized secret sharing and monotone functions. In: Advances in Cryptology (CRYPTO 1988). Lecture Notes in Computer Science, vol. 403, pp. 27\u201335 (1988)."},{"key":"529_CR11","doi-asserted-by":"crossref","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: 1979 AFIPS National Computer Conference, pp. 313\u2013317 (1979).","DOI":"10.1109\/MARK.1979.8817296"},{"key":"529_CR12","first-page":"105","volume":"6","author":"EF Brickell","year":"1989","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 6, 105\u2013113 (1989).","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"73","key":"529_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell E.F., Davenport D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4(73), 123\u2013134 (1991).","journal-title":"J. Cryptol."},{"key":"529_CR14","unstructured":"Cramer R., Damg\u00e5rd I., Maurer U.: Computation general secure multi-party, from any linear secret-sharing scheme. In: Advances in Cryptology\u2014EUROCRYPT 2000. Lecture Notes in Computer Science, vol. 1807, pp. 316\u2013334 (2000)."},{"key":"529_CR15","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. Cryptol. 10, 223\u2013231 (1997).","journal-title":"J. Cryptol."},{"issue":"3","key":"529_CR16","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10623-013-9888-2","volume":"74","author":"L Csirmaz","year":"2015","unstructured":"Csirmaz L.: Secret sharing on the d-dimensional cube. Des. Codes Cryptogr. 74(3), 719\u2013729 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"529_CR17","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25(1), 434\u2013463 (2012).","journal-title":"J. Cryptol."},{"issue":"2","key":"529_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10623-011-9552-7","volume":"63","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O., Metcalf-Burton J.R., Padr\u00f3 C., V\u00e1zquez L.: On the optimization of bipartite secret sharing schemes. Des. Codes Cryptogr. 63(2), 255\u2013271 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"529_CR19","unstructured":"Farr\u00e0s O., Ribes-Gonz\u00e1lez J., Ricci S.: Local bounds for the optimal information ratio of secret sharing schemes. IACR Cryptol. ePrint Archive 2016, 726 (2016)."},{"key":"529_CR20","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s00453-016-0217-9","volume":"79","author":"O Farr\u00e0s","year":"2017","unstructured":"Farr\u00e0s O., Hansen T., Kaced T., Padr\u00f3 C.: On the information ratio of non-perfect secret sharing schemes. Algorithmica 79, 987\u20131013 (2017).","journal-title":"Algorithmica"},{"key":"529_CR21","unstructured":"Farr\u00e0s O., Ribes-Gonz\u00e1lez J., Ricci S.: Privacy-preserving data splitting: a combinatorial approach. arXiv:1801.05974 (2018)."},{"key":"529_CR22","unstructured":"Farr\u00e0s O., Kaced T., Mart\u00edn S., Padr\u00f3 C.: Improving the linear programming technique in the search for lower bounds in secret sharing. In: Advances in Cryptology (EUROCRYPT 2018). Lecture Notes in Computer Science, vol. 10820, pp. 597\u2013621 (2018)."},{"key":"529_CR23","unstructured":"Frankl P.: Extremal set systems. In: Handbook of Combinatorics, vol. II, pp. 1293\u20131329. Elsevier, Amsterdam (1995)."},{"issue":"4","key":"529_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A G\u00e1l","year":"2001","unstructured":"G\u00e1l A.: A characterization of span program size and improved lower bounds for monotone span programs. Comput. Complex. 10(4), 277\u2013296 (2001).","journal-title":"Comput. Complex."},{"key":"529_CR25","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).","DOI":"10.1145\/1180405.1180418"},{"key":"529_CR26","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing any access structure. In: Proceedings of IEEE Globecom\u201987, pp. 99\u2013102 (1987)."},{"issue":"2","key":"529_CR27","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110840741","volume":"42","author":"M Jha","year":"2013","unstructured":"Jha M., Raskhodnikova S.: Testing and reconstruction of Lipschitz functions with applications to data privacy. SIAM J. Comput. 42(2), 700\u2013731 (2013).","journal-title":"SIAM J. Comput."},{"key":"529_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity. Advances and Frontiers","author":"S Jukna","year":"2012","unstructured":"Jukna S.: Boolean Function Complexity. Advances and Frontiers. Springer, Berlin (2012)."},{"key":"529_CR29","doi-asserted-by":"crossref","unstructured":"Karchmer M., Wigderson A.: On span programs. In: 8th Structure in Complexity Theory, pp. 102\u2013111 (1993).","DOI":"10.1109\/SCT.1993.336536"},{"key":"529_CR30","doi-asserted-by":"crossref","unstructured":"Komargodski I., Naor M., Yogev E.: Secret-sharing for NP. In: Advances in Cryptology (ASIACRYPT 2014). Lecture Notes in Computer Science, vol. 8874, pp. 254\u2013273 (2014).","DOI":"10.1007\/978-3-662-45608-8_14"},{"key":"529_CR31","unstructured":"Liu T., Vaikuntanathan V., Wee H.: Conditional disclosure of secrets via non-linear reconstruction. In: Advances in Cryptology (CRYPTO 2017). Lecture Notes in Computer Science, vol. 10401, pp. 758\u2013790 (2017)."},{"key":"529_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1515\/jmc.2010.004","volume":"4","author":"J Mart\u00ed-Farr\u00e9","year":"2010","unstructured":"Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4, 95\u2013120 (2010).","journal-title":"J. Math. Cryptol."},{"key":"529_CR33","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TIT.2015.2500232","volume":"62","author":"S Mart\u00edn","year":"2016","unstructured":"Mart\u00edn S., Padr\u00f3 C., Yang A.: Secret sharing, rank inequalities, and information inequalities. IEEE Trans. Inf. Theory 62, 599\u2013609 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"529_CR34","unstructured":"Padr\u00f3 C.: Lecture Notes in Secret Sharing. Cryptology ePrint Archive 2012\/674."},{"key":"529_CR35","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.dam.2012.10.020","volume":"161","author":"C Padr\u00f3","year":"2013","unstructured":"Padr\u00f3 C., V\u00e1zquez L., Yang A.: Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discret. Appl. Math. 161, 1072\u20131084 (2013).","journal-title":"Discret. Appl. Math."},{"key":"529_CR36","doi-asserted-by":"crossref","unstructured":"Pitassi T., Robere R.: Lifting Nullstellensatz to monotone span programs over any field. In: Electronic Colloquium on Computational Complexity (ECCC), p. 165 (2017).","DOI":"10.1145\/3188745.3188914"},{"issue":"1","key":"529_CR37","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02122698","volume":"10","author":"AA Razborov","year":"1990","unstructured":"Razborov A.A.: Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10(1), 81\u201393 (1990).","journal-title":"Combinatorica"},{"key":"529_CR38","doi-asserted-by":"crossref","unstructured":"Razborov A.A.: On submodular complexity measures. In: Proceedings of the London Mathematical Society Symposium on Boolean Function Complexity, pp. 76\u201383 (1992).","DOI":"10.1017\/CBO9780511526633.007"},{"key":"529_CR39","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. Commun. ACM 22, 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"529_CR40","unstructured":"Vaikuntanathan V., Vasudevan P.N.: Sharing secret, advances statistical zero knowledge. In: Cryptology (ASIACRYPT 2015). Lecture Notes in Computer Science, vol. 9452, pp. 656\u2013680 (2015)."},{"key":"529_CR41","volume-title":"The Complexity of Boolean Functions","author":"I Wegener","year":"1987","unstructured":"Wegener I.: The Complexity of Boolean Functions. Wiley-Teubner, New York (1987)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0529-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0529-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0529-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T08:16:30Z","timestamp":1751789790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0529-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["529"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0529-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"23 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}