{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:02:47Z","timestamp":1764133367578,"version":"3.40.3"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030643805"},{"type":"electronic","value":"9783030643812"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_18","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T18:04:25Z","timestamp":1607796265000},"page":"499-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Oriol","family":"Farr\u00e0s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"B Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-03807-6_12","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2018","unstructured":"Applebaum, B., Arkis, B.: On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 317\u2013344. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_12"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-319-63688-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Arkis, B., Raykov, P., Vasudevan, P.N.: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 727\u2013757. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_24"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-17659-4_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Applebaum","year":"2019","unstructured":"Applebaum, B., Beimel, A., Farr\u00e0s, O., Nir, O., Peter, N.: Secret-sharing schemes for general and uniform access structures. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 441\u2013471. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_15"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Nir, O., Peter, N.: Better secret sharing via robust conditional disclosure of secrets. In: Proceedings of the 52th ACM Symposium on the Theory of Computing, pp. 280\u2013293 (2020)","DOI":"10.1145\/3357713.3384293"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-78375-8_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Applebaum","year":"2018","unstructured":"Applebaum, B., Holenstein, T., Mishra, M., Shayevitz, O.: The communication complexity of private simultaneous messages, revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 261\u2013286. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_9"},{"key":"18_CR7","unstructured":"Applebaum, B., Vasudevan, P.N.: Placing conditional disclosure of secrets in the communication complexity universe. In: 10th ITCS, pp. 4:1\u20134:14 (2019)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-55220-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Attrapadung","year":"2014","unstructured":"Attrapadung, N.: Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 557\u2013577. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_31"},{"issue":"3","key":"18_CR9","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":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.W., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-54242-8_17","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Ben-Efraim, A., Padr\u00f3, C., Tyomkin, I.: Multi-linear secret-sharing schemes. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 394\u2013418. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_17"},{"issue":"3","key":"18_CR12","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. Inf. Theory 40(3), 786\u2013794 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Beimel, A., Farr\u00e0s, O.: The share size of secret-sharing schemes for almost all access structures and graphs. IACR Cryptology ePrint Archive 2020, 664 (2020)","DOI":"10.1007\/978-3-030-64381-2_18"},{"issue":"2","key":"18_CR14","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":"18_CR15","doi-asserted-by":"crossref","unstructured":"Beimel, A., Farr\u00e0s, O., Mintz, Y., Peter, N.: Linear secret-sharing schemes for forbidden graph access structures. Technical report 2017\/940, IACR Cryptology ePrint Archive (2017). Full version of [16]","DOI":"10.1007\/978-3-319-70503-3_13"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-319-70503-3_13","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2017","unstructured":"Beimel, A., Farr\u00e0s, O., Mintz, Y., Peter, N.: Linear secret-sharing schemes for forbidden graph access structures. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 394\u2013423. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_13"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01202040","volume":"6","author":"A Beimel","year":"1997","unstructured":"Beimel, A., G\u00e1l, A., Paterson, M.: Lower bounds for monotone span programs. Comput. Complex. 6(1), 29\u201345 (1997)","journal-title":"Comput. Complex."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-54242-8_14","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Ishai, Y., Kumaresan, R., Kushilevitz, E.: On the cryptographic complexity of the worst functions. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 317\u2013342. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_14"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-78375-8_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Kushilevitz, E., Nissim, P.: The complexity of multiparty PSM protocols and related models. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 287\u2013318. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_10"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-030-03332-3_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Peter, N.: Optimal linear multiparty conditional disclosure of secrets protocols. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 332\u2013362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_13"},{"issue":"5","key":"18_CR21","doi-asserted-by":"publisher","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(5), 1196\u20131215 (2005)","journal-title":"SIAM J. Comput."},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 1988","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in Cryptology \u2014 AUSCRYPT 1992","author":"M Bertilsson","year":"1993","unstructured":"Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 67\u201379. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_53"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference. AFIPS Conference Proceedings, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","volume":"154","author":"C Blundo","year":"1996","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. Theoret. Comput. Sci. 154(2), 283\u2013306 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/18.370169","volume":"41","author":"C Blundo","year":"1995","unstructured":"Blundo, C., Santis, A.D., Gaggia, A.G., Vaccaro, U.: New bounds on the information rate of secret sharing schemes. IEEE Trans. Inf. Theory 41(2), 549\u2013553 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0195-6698(81)80015-7","volume":"2","author":"B Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s, B., Thomason, A.: Graphs which contain all small graphs. Eur. J. Combin. 2(1), 13\u201315 (1981)","journal-title":"Eur. J. Combin."},{"key":"18_CR29","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":"3","key":"18_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"RM Capocelli","year":"1993","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. Cryptol. 6(3), 157\u2013168 (1993)","journal-title":"J. Cryptol."},{"issue":"2","key":"18_CR31","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. Cryptol. 6(2), 87\u201396 (1993)","journal-title":"J. Cryptol."},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"issue":"3\u20134","key":"18_CR33","first-page":"429","volume":"32","author":"L Csirmaz","year":"1996","unstructured":"Csirmaz, L.: The dealer\u2019s random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar. 32(3\u20134), 429\u2013437 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"issue":"4","key":"18_CR34","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(4), 223\u2013231 (1997)","journal-title":"J. Cryptol."},{"key":"18_CR35","unstructured":"Csirmaz, L.: Secret sharing schemes on graphs. Technical report 2005\/059, Cryptology ePrint Archive (2005). eprint.iacr.org\/"},{"issue":"3","key":"18_CR36","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10623-009-9304-0","volume":"53","author":"L Csirmaz","year":"2009","unstructured":"Csirmaz, L.: An impossibility result on graph secret sharing. Des. Codes Cryptogr. 53(3), 195\u2013209 (2009)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"18_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M van Dijk","year":"1995","unstructured":"van Dijk, M.: On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 6(2), 143\u2013169 (1995)","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20133","key":"18_CR38","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0012-365X(96)00124-0","volume":"170","author":"P Erd\u00f6s","year":"1997","unstructured":"Erd\u00f6s, P., Pyber, L.: Covering a graph by complete bipartite graphs. Discrete Math. 170(1\u20133), 249\u2013251 (1997)","journal-title":"Discrete Math."},{"key":"18_CR39","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"I. Publ. Math. Debrecen"},{"key":"18_CR40","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0020-0190(03)00334-X","volume":"87","author":"A G\u00e1l","year":"2003","unstructured":"G\u00e1l, A., Pudl\u00e1k, P.: Monotone complexity and the rank of matrices. Inf. Process. Lett. 87, 321\u2013326 (2003)","journal-title":"Inf. Process. Lett."},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-48000-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Gay","year":"2015","unstructured":"Gay, R., Kerenidis, I., Wee, H.: Communication complexity of conditional disclosure of secrets and attribute-based encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 485\u2013502. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_24"},{"issue":"3","key":"18_CR42","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Y Gertner","year":"2000","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci. 60(3), 592\u2013629 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"18_CR43","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"GR Grimmett","year":"1975","unstructured":"Grimmett, G.R., McDiarmid, C.J.H.: On colouring random graphs. Math. Proc. Cambridge Philos. Soc. 77(2), 313\u2013324 (1975)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: GLOBECOM 1987, pp. 99\u2013102 (1987). Journal version: Multiple assignment scheme for sharing secret. J. Cryptol. 6(1), 15\u201320 (1993)","DOI":"10.1007\/BF02620229"},{"key":"18_CR45","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: 8th Structure in Complexity Theory, pp. 102\u2013111 (1993)"},{"issue":"1","key":"18_CR46","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"ED Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29(1), 35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR47","first-page":"5","volume":"38","author":"AD Korshunov","year":"1981","unstructured":"Korshunov, A.D.: On the number of monotone Boolean functions. Probl. Kibern 38, 5\u2013108 (1981)","journal-title":"Probl. Kibern"},{"key":"18_CR48","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: 50th STOC, pp. 699\u2013708 (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"18_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-319-63688-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"T Liu","year":"2017","unstructured":"Liu, T., Vaikuntanathan, V., Wee, H.: Conditional disclosure of secrets via non-linear reconstruction. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 758\u2013790. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_25"},{"key":"18_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-78381-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"T Liu","year":"2018","unstructured":"Liu, T., Vaikuntanathan, V., Wee, H.: Towards breaking the exponential barrier for general secret sharing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 567\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_21"},{"issue":"2","key":"18_CR51","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(2), 95\u2013120 (2010)","journal-title":"J. Math. Cryptol."},{"key":"18_CR52","unstructured":"Mintz, Y.: Information ratios of graph secret-sharing schemes. Master\u2019s thesis, Department of Computer Science, Ben Gurion University (2012)"},{"issue":"2","key":"18_CR53","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1112\/blms.12141","volume":"50","author":"P Nelson","year":"2018","unstructured":"Nelson, P.: Almost all matroids are non-representable. Bull. Lond. Math. Soc. 50(2), 245\u2013248 (2018)","journal-title":"Bull. Lond. Math. Soc."},{"key":"18_CR54","unstructured":"Peter, N.: Secret-sharing schemes and conditional disclosure of secrets protocols. Ph.D. thesis, Ben-Gurion University of the Negev (2020). http:\/\/aranne5.bgu.ac.il\/others\/PeterNaty19903.pdf"},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Pitassi, T., Robere, R.: Lifting Nullstellensatz to monotone span programs over any field. In: 50th STOC, pp. 1207\u20131219 (2018)","DOI":"10.1145\/3188745.3188914"},{"issue":"3","key":"18_CR56","first-page":"717","volume":"14","author":"L R\u00f3nyai","year":"2001","unstructured":"R\u00f3nyai, L., Babai, L., Ganapathy, M.K.: On the number of zero-patterns of a sequence of polynomials. J. AMS 14(3), 717\u2013735 (2001)","journal-title":"J. AMS"},{"key":"18_CR57","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"},{"issue":"1","key":"18_CR58","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28(1), 59\u201398 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"18_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology \u2014 CRYPTO 1988","author":"GJ Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390\u2013448. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_30"},{"key":"18_CR60","unstructured":"Sun, H.M., Shieh, S.P.: Secret sharing in graph-based prohibited structures. In: INFOCOM 1997, pp. 718\u2013724 (1997)"},{"key":"18_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-54242-8_26","volume-title":"Theory of Cryptography","author":"H Wee","year":"2014","unstructured":"Wee, H.: Dual system encryption via predicate encodings. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 616\u2013637. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_26"},{"key":"18_CR62","series-title":"Wiley-Teubner Series in Computer Science","volume-title":"The Complexity of Boolean Functions","author":"I Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner Series in Computer Science. B. G. Teubner and John Wiley, Chichester (1987)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T01:09:15Z","timestamp":1702343355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}