{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:31:12Z","timestamp":1773513072571,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780226","type":"print"},{"value":"9783031780233","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78023-3_17","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:51:22Z","timestamp":1733136682000},"page":"517-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reducing the\u00a0Share Size of\u00a0Weighted Threshold Secret Sharing Schemes via\u00a0Chow Parameters Approximation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7495-5980","authenticated-orcid":false,"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3187-2321","authenticated-orcid":false,"given":"Miquel","family":"Guiot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Ishai, Y., Kushilevitz, E., Liu, T., Vaikuntanathan, V.: Succinct computational secret sharing. In: STOC 2023, pp. 1553\u20131566. ACM (2023)","DOI":"10.1145\/3564246.3585127"},{"key":"17_CR2","unstructured":"Breidenbach, L., et\u00a0al.: Chainlink 2.0: Next steps in the evolution of decentralized oracle networks. Technical report, Chainlink Labs (2021)"},{"issue":"73","key":"17_CR3","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. Cryptology 4(73), 123\u2013134 (1991)","journal-title":"J. Cryptology"},{"key":"17_CR4","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.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"17_CR5","first-page":"664","volume":"2020","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. IACR Cryptol. ePrint Arch. 2020, 664 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"17_CR6","unstructured":"Benhamouda, F., Halevi, S., Stambler, L.: Weighted secret sharing from wiretap channels. In: 4th Conference on Information-Theoretic Cryptography, ITC 2023, vol. 267. LIPIcs, pp. 8:1\u20138:19 (2023)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S., (ed.) CRYPTO \u201988, vol. 403. LNCS, pp. 27\u201335. Springer (1988)","DOI":"10.1007\/0-387-34799-2_3"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. of the 1979 AFIPS National Computer Conference, vol. 48. AFIPS Conference proceedings, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"17_CR9","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 6, 105\u2013113 (1989)"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0895480104445654","volume":"22","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Discrete Math. 22(1), 360\u2013397 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Beimel, A.,\u00a0Weinreb, E.: Monotone circuits for monotone weighted threshold functions. Inform. Process. Lett. 97(1), 12\u201318 (2006). Conference version: Proc. of 20th Annu. IEEE Conf. on Computational Complexity, pp. 67\u201375 (2005)","DOI":"10.1016\/j.ipl.2005.09.008"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Chow, C.K.: On the characterization of threshold functions. In: 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961), pp. 34\u201338 (1961)","DOI":"10.1109\/FOCS.1961.24"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TIT.2021.3123102","volume":"68","author":"Q Chen","year":"2022","unstructured":"Chen, Q., Tang, C., Lin, Z.: Efficient explicit constructions of multipartite secret sharing schemes. IEEE Trans. Inf. Theory 68, 601\u2013631 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"De, A., Diakonikolas, I., Feldman, V., Servedio, R.A.: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. J. ACM 61(2), April 2014","DOI":"10.1145\/2590772"},{"key":"17_CR15","unstructured":"Das, S., Pinkas, B., Tomescu, A., Xiang, Z.: Distributed randomness using weighted vrfs. Cryptology ePrint Archive, Report 2024\/198 (2024). https:\/\/eprint.iacr.org\/2024\/198"},{"key":"17_CR16","unstructured":"Farr\u00e0s, O., Guiot, M.: Reducing the share size of weighted threshold secret sharing schemes via chow parameters approximation. Cryptology ePrint Archive, Report 2024\/772 (2024). https:\/\/eprint.iacr.org\/2024\/772"},{"issue":"5","key":"17_CR17","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":"17_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: Cryptography with weights: Mpc, encryption and signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, pp. 295\u2013327. Springer, Switzerland (2023)","DOI":"10.1007\/978-3-031-38557-5_10"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0895480192235878","volume":"7","author":"J H\u00e5stad","year":"1994","unstructured":"H\u00e5stad, J.: On the size of weights for threshold gates. SIAM J. Discrete Math. 7(3), 484\u2013492 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"17_CR20","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":"17_CR21","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology \u2013 CRYPTO 2017, pp. 357\u2013388. Springer (2017)","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"17_CR22","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":"17_CR23","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":"17_CR24","doi-asserted-by":"crossref","unstructured":"Mignotte, M.: How to share a secret. In: Beth, T., (ed.) Cryptography, pp. 371\u2013375. Springer, Heidelberg (1983)","DOI":"10.1007\/3-540-39466-4_27"},{"issue":"4","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1007\/s10623-022-01154-9","volume":"91","author":"S Mo","year":"2023","unstructured":"Mo, S.: Ideal hierarchical secret sharing and lattice path matroids. Des. Codes Cryptogr. 91(4), 1335\u20131349 (2023)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"17_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(99)00070-8","volume":"70","author":"P Morillo","year":"1999","unstructured":"Morillo, P., Padr\u00f3, C., S\u00e1ez, G., Villar, J.L.: Weighted threshold secret sharing schemes. Inform. Process. Lett. 70(5), 211\u2013216 (1999)","journal-title":"Inform. Process. Lett."},{"key":"17_CR27","unstructured":"Muroga, S.: Threshold Logic and Its Applications. Wiley-Interscience (1971)"},{"key":"17_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, USA (2014)"},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/090756466","volume":"40","author":"R O\u2019Donnell","year":"2011","unstructured":"O\u2019Donnell, R., Servedio, R.A.: The chow parameters problem. SIAM J. Comput. 40(1), 165\u2013199 (2011)","journal-title":"SIAM J. Comput."},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Padr\u00f3, C.: Efficient representation of lattice path matroids. Ann. Comb. (2024)","DOI":"10.1007\/s00026-024-00716-z"},{"issue":"7","key":"17_CR31","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/18.887867","volume":"46","author":"C Padr\u00f3","year":"2000","unstructured":"Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory 46(7), 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"17_CR32","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0404038","volume":"4","author":"K-Y Siu","year":"1991","unstructured":"Siu, K.-Y., Bruck, J.: On the power of threshold circuits with small weights. SIAM J. Discret. Math. 4(3), 423\u2013435 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"17_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.dam.2004.02.003","volume":"142","author":"RA Servedio","year":"2004","unstructured":"Servedio, R.A.: Monotone Boolean formulas can approximate monotone linear threshold functions. Discrete Appl. Math. 142(1\u20133), 181\u2013187 (2004)","journal-title":"Discrete Appl. Math."},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Servedio, R.A.: Every linear threshold function has a low-weight approximator. In: 21st Annual IEEE Conference on Computational Complexity (CCC\u201906), pp. 18\u201332 (2006)","DOI":"10.1109\/CCC.2006.18"},{"key":"17_CR35","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":"17_CR36","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: How to (really) share a secret. In: CRYPTO, pp. 390\u2013448 (1988)","DOI":"10.1007\/0-387-34799-2_30"},{"issue":"2","key":"17_CR37","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. J. Cryptology 20(2), 237\u2013264 (2007)","journal-title":"J. Cryptology"},{"issue":"2","key":"17_CR38","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T Tassa","year":"2009","unstructured":"Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. J. Cryptology 22(2), 227\u2013258 (2009)","journal-title":"J. Cryptology"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Tonkikh, A., Freitas, L.: Swiper: a new paradigm for efficient weighted distributed protocols. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC \u201924, pp. 283\u2013294. Association for Computing Machinery (2024)","DOI":"10.1145\/3662158.3662799"},{"key":"17_CR40","unstructured":"Yao, A.C.: Unpublished manuscript, 1989. Presented at Oberwolfach and DIMACS Workshops"}],"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-031-78023-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:05:16Z","timestamp":1733137516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}