{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:33:05Z","timestamp":1764621185737,"version":"3.46.0"},"publisher-location":"Cham","reference-count":72,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122926","type":"print"},{"value":"9783032122933","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12293-3_14","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:11Z","timestamp":1764620891000},"page":"428-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Secret Sharing Schemes and\u00a0Algebraic Matroids"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6572-4195","authenticated-orcid":false,"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7495-5980","authenticated-orcid":false,"given":"Oriol","family":"Farr\u00e0s","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9662-1016","authenticated-orcid":false,"given":"Adriana","family":"Moya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"14_CR1","unstructured":"Alon, B., Beimel, A., Lasri, O.: Simplified PIR and CDS protocols and improved linear secret-sharing schemes. Technical report 2024\/1599, IACR Cryptology ePrint Archive (2024)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Avron, J., Brzuska, C.: Arithmetic cryptography. J. ACM 64(2) (2017)","DOI":"10.1145\/3046675"},{"key":"14_CR3","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":"14_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Nir, O., Peter, N.: Better secret sharing via robust conditional disclosure of secrets. In: 52nd STOC, pp. 280\u2013293 (2020)","DOI":"10.1145\/3357713.3384293"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-030-84252-9_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"B Applebaum","year":"2021","unstructured":"Applebaum, B., Nir, O.: Upslices, downslices, and secret-sharing with complexity of $$1.5^n$$. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 627\u2013655. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_21"},{"issue":"3","key":"14_CR6","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"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10623-020-00811-1","volume":"89","author":"M Bamiloshin","year":"2021","unstructured":"Bamiloshin, M., Ben-Efraim, A., Farr\u00e0s, O., Padr\u00f3, C.: Common information, matroid representation, and secret sharing for matroid ports. Des. Codes Cryptogr. 89(1), 143\u2013166 (2021)","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2012.10.004","volume":"222","author":"M Beecken","year":"2013","unstructured":"Beecken, M., Mittmann, J., Saxena, N.: Algebraic independence and blackbox identity testing. Inf. Comput. 222, 2\u201319 (2013)","journal-title":"Inf. Comput."},{"key":"14_CR9","unstructured":"Beimel, A.: Secret-sharing schemes for general access structures: an introduction. Cryptology ePrint Archive, Paper 2025\/518 (2025)"},{"key":"14_CR10","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":"14_CR11","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":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-64381-2_18","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2020","unstructured":"Beimel, A., Farr\u00e0s, O.: The share size of secret-sharing schemes for almost all access structures and graphs. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 499\u2013529. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_18"},{"key":"14_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-031-48618-0_13","volume-title":"TCC 2023","author":"A Beimel","year":"2023","unstructured":"Beimel, A., Farr\u00e0s, O., Lasri, O.: Improved polynomial secret-sharing schemes. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14370, pp. 374\u2013405. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_13"},{"key":"14_CR14","unstructured":"Beimel, A., Farr\u00e0s, O., Moya, A.: Polynomial secret sharing schemes and algebraic matroids. Cryptology ePrint Archive, Paper 2025\/368 (2025)"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","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. SIAM J. Discret. Math. 19(1), 258\u2013280 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"11","key":"14_CR16","doi-asserted-by":"publisher","first-page":"7295","DOI":"10.1109\/TIT.2023.3296588","volume":"69","author":"A Beimel","year":"2023","unstructured":"Beimel, A., Othman, H., Peter, N.: Quadratic secret sharing and conditional disclosure of secrets. IEEE Trans. Inf. Theory 69(11), 7295\u20137316 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-30576-7_32","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2005","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 600\u2013619. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_32"},{"issue":"8","key":"14_CR18","doi-asserted-by":"publisher","first-page":"2136","DOI":"10.1016\/j.disc.2016.02.012","volume":"339","author":"A Ben-Efraim","year":"2016","unstructured":"Ben-Efraim, A.: Secret-sharing matroids need not be algebraic. Discret. Math. 339(8), 2136\u20132145 (2016)","journal-title":"Discret. Math."},{"key":"14_CR19","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\u2019 88","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":"14_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.jalgebra.2013.10.013","volume":"399","author":"J Berson","year":"2014","unstructured":"Berson, J.: Linearized polynomial maps over finite fields. J. Algebra 399, 389\u2013406 (2014)","journal-title":"J. Algebra"},{"key":"14_CR21","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 \u201992","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":"14_CR22","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-58265-7_5","volume-title":"Error Control, Cryptology, and Speech Compression","author":"GR Blakley","year":"1994","unstructured":"Blakley, G.R., Kabatianskii, G.A.: Linear algebra approach to secret sharing schemes. In: Chmora, A., Wicker, S.B. (eds.) ECCSP 1993. LNCS, vol. 829, pp. 33\u201340. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58265-7_5"},{"key":"14_CR24","unstructured":"Boege, T.: The entropy profiles of a definable set over finite fields (2025). https:\/\/arxiv.org\/abs\/2502.20355"},{"key":"14_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-031-38557-5_6","volume-title":"CRYPTO 2023","author":"D Boneh","year":"2023","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Arithmetic sketching. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14081, pp. 171\u2013202. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_6"},{"key":"14_CR26","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":"2","key":"14_CR27","doi-asserted-by":"publisher","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(2), 123\u2013134 (1991). https:\/\/doi.org\/10.1007\/BF00196772","journal-title":"J. Cryptol."},{"issue":"2","key":"14_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ffa.2005.03.003","volume":"12","author":"A Cafure","year":"2006","unstructured":"Cafure, A., Matera, G.: Improved explicit estimates on the number of solutions of equations over a finite field. Finite Fields Appl. 12(2), 155\u2013185 (2006)","journal-title":"Finite Fields Appl."},{"issue":"9","key":"14_CR29","doi-asserted-by":"publisher","first-page":"5600","DOI":"10.1109\/TIT.2013.2264504","volume":"59","author":"I Cascudo","year":"2013","unstructured":"Cascudo, I., Cramer, R., Xing, C.: Bounds on the threshold gap in secret sharing and its applications. IEEE Trans. Inf. Theory 59(9), 5600\u20135612 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471\u2013488. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_27"},{"issue":"3","key":"14_CR31","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 Cryptography 53(3), 195\u2013209 (2009)","journal-title":"Des. Codes Cryptography"},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1515\/jmc-2019-0045","volume":"15","author":"L Csirmaz","year":"2019","unstructured":"Csirmaz, L.: Secret sharing and duality. J. Math. Cryptol. 15, 157\u2013173 (2019)","journal-title":"J. Math. Cryptol."},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","volume":"24","author":"I Csisz\u00e1r","year":"1978","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J.: Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24, 339\u2013348 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15317-4_9","volume-title":"Security and Cryptography for Networks","author":"F Dav\u00ec","year":"2010","unstructured":"Dav\u00ec, F., Dziembowski, S., Venturi, D.: Leakage-resilient storage. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 121\u2013137. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_9"},{"issue":"4","key":"14_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"RA Demillo","year":"1978","unstructured":"Demillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978)","journal-title":"Inf. Process. Lett."},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BFb0053421","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"M Dijk","year":"1995","unstructured":"Dijk, M.: A linear construction of perfect secret sharing schemes. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 23\u201334. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053421"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Dvir, Z.: Extractors for varieties. In: 24th CCC, pp. 102\u2013113 (2009)","DOI":"10.1109\/CCC.2009.7"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Gabizon, A., Wigderson, A.: Extractors and rank extractors for polynomial sources. In: FOCS 2007, pp. 52\u201362 (2007)","DOI":"10.1109\/FOCS.2007.9"},{"issue":"5","key":"14_CR39","first-page":"903","volume":"56","author":"O Farr\u00e0s","year":"2020","unstructured":"Farr\u00e0s, O.: Secret sharing schemes for ports of matroids of rank 3. Kybernetika 56(5), 903\u2013915 (2020)","journal-title":"Kybernetika"},{"issue":"4","key":"14_CR40","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.B., Kaced, T., Padr\u00f3, C.: On the information ratio of non-perfect secret sharing schemes. Algorithmica 79(4), 987\u20131013 (2017)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR41","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(3), 434\u2013463 (2012)","journal-title":"J. Cryptol."},{"issue":"5","key":"14_CR42","doi-asserted-by":"publisher","first-page":"3273","DOI":"10.1109\/TIT.2011.2182034","volume":"58","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. Theory 58(5), 3273\u20133286 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR43","unstructured":"Fehr, S.: Efficient construction of the dual span program (1999)"},{"key":"14_CR44","first-page":"14","volume":"61","author":"S Fujishige","year":"1978","unstructured":"Fujishige, S.: Entropy functions and and polymatroids\u2013combinatorial structures in information theory. Electron. Comm. Jpn. 61, 14\u201318 (1978)","journal-title":"Electron. Comm. Jpn."},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0019-9958(78)91063-X","volume":"39","author":"S Fujishige","year":"1978","unstructured":"Fujishige, S.: Polymatroidal dependence structure of a set of random variables. Inf. Control 39, 55\u201372 (1978)","journal-title":"Inf. Control"},{"key":"14_CR46","unstructured":"G\u00e1l, A.: Combinatorial methods in boolean function complexity. Ph.D. thesis, University of Chicago (1995)"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"G\u00fcrpinar, E., Romashchenko, A.: How to use undiscovered information inequalities: direct applications of the copy lemma. In: ISIT 2019, pp. 1377\u20131381. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849309"},{"key":"14_CR48","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"},{"issue":"8","key":"14_CR49","doi-asserted-by":"publisher","first-page":"5364","DOI":"10.1109\/TIT.2023.3265093","volume":"69","author":"A Jafari","year":"2023","unstructured":"Jafari, A., Khazaei, S.: Partial secret sharing schemes. IEEE Trans. Inf. Theory 69(8), 5364\u20135385 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR50","unstructured":"Mittmann, J.: Independence in algebraic complexity theory. Ph.D. thesis, Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (2013)"},{"issue":"6","key":"14_CR51","doi-asserted-by":"publisher","first-page":"4379","DOI":"10.1109\/TIT.2018.2823328","volume":"64","author":"T Kaced","year":"2018","unstructured":"Kaced, T.: Information inequalities are not closed under polymatroid duality. IEEE Trans. Inf. Theory 64(6), 4379\u20134381 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require super-logarithmic depth. In: 20th STOC, pp. 539\u2013550 (1988)","DOI":"10.1145\/62212.62265"},{"issue":"1","key":"14_CR53","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":"14_CR54","doi-asserted-by":"crossref","unstructured":"Kayal, N.: The complexity of the annihilating polynomial. In: 24th CCC, pp. 184\u2013193 (2009)","DOI":"10.1109\/CCC.2009.37"},{"key":"14_CR55","doi-asserted-by":"publisher","first-page":"819","DOI":"10.2307\/2372655","volume":"76","author":"S Lang","year":"1954","unstructured":"Lang, S., Weil, A.: Number of points of varieties in finite fields. Am. J. Math. 76, 819\u2013827 (1954)","journal-title":"Am. J. Math."},{"key":"14_CR56","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":"14_CR57","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"},{"issue":"2","key":"14_CR58","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":"14_CR59","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F Mat\u00fa\u0161","year":"1999","unstructured":"Mat\u00fa\u0161, F.: Matroid representations by partitions. Discret. Math. 203, 169\u2013194 (1999)","journal-title":"Discret. Math."},{"key":"14_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/proc\/13846","volume":"152","author":"F Mat\u00fa\u0161","year":"2024","unstructured":"Mat\u00fa\u0161, F.: Algebraic matroids are almost entropic. Proc. Am. Math. Soc. 152, 1\u20136 (2024)","journal-title":"Proc. Am. Math. Soc."},{"key":"14_CR61","unstructured":"Oxley, J.G.: Matroid Theory, 2nd edn. Oxford Science Publications, The Clarendon Press, Oxford University Press, New York (2011)"},{"key":"14_CR62","unstructured":"Paskin-Cherniavsky, A., Radune, A.: On polynomial secret sharing schemes. In: ITC 2020. LIPIcs, vol. 163, pp. 12:1\u201312:21 (2020)"},{"issue":"3","key":"14_CR63","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":"14_CR64","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"14_CR65","doi-asserted-by":"crossref","unstructured":"Seymour, P.D.: On secret-sharing matroids. J. Combinatorial Theory Ser. B 56, 69\u201373 (1992)","DOI":"10.1016\/0095-8956(92)90007-K"},{"key":"14_CR66","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":"2","key":"14_CR67","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J Simonis","year":"1998","unstructured":"Simonis, J., Ashikhmin, A.: Almost affine codes. Des. Codes Crypt. 14(2), 179\u2013197 (1998)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"14_CR68","doi-asserted-by":"publisher","first-page":"654","DOI":"10.4153\/S0008439522000625","volume":"66","author":"K Slavov","year":"2023","unstructured":"Slavov, K.: Nearly sharp Lang-Weil bounds for a hypersurface. Can. Math. Bull. 66(2), 654\u2013664 (2023)","journal-title":"Can. Math. Bull."},{"key":"14_CR69","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jnth.1996.0078","volume":"58","author":"T Wooley","year":"1996","unstructured":"Wooley, T.: A note on simultaneous congruences. J. Number Theory 58, 288\u2013297 (1996)","journal-title":"J. Number Theory"},{"issue":"8","key":"14_CR70","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975)","journal-title":"Bell Syst. Tech. J."},{"key":"14_CR71","first-page":"1044","volume":"60","author":"M Yassaee","year":"2012","unstructured":"Yassaee, M., Aref, M., Gohari, A.: Achievability proof via output statistics of random binning. IEEE Trans. Inf. Theory 60, 1044\u20131048 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"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-032-12293-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:14Z","timestamp":1764620894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12293-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122926","9783032122933"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12293-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}