{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T07:23:39Z","timestamp":1766647419593,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780226"},{"type":"electronic","value":"9783031780233"}],"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_18","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:50:38Z","timestamp":1733136638000},"page":"548-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["New Upper Bounds for\u00a0Evolving Secret Sharing via\u00a0Infinite Branching Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8392-0245","authenticated-orcid":false,"given":"Bar","family":"Alon","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6572-4195","authenticated-orcid":false,"given":"Amos","family":"Beimel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9149-7334","authenticated-orcid":false,"given":"Tamar","family":"Ben David","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8928-0587","authenticated-orcid":false,"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6566-2644","authenticated-orcid":false,"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"18_CR1","unstructured":"Alon, B., Beimel, A., Ben David, T., Omri, E., Paskin-Cherniavsky, A.: New upper bounds for evolving secret sharing via infinite branching programs. Cryptology ePrint Archive, Paper 2024\/419 (2024). https:\/\/eprint.iacr.org\/2024\/419"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Arkis, B.: On the power of amortization in secret sharing: $$d$$-uniform secret sharing and CDS with constant information rate. In: TCC 2018, vol. 11239. LNCS, pp. 317\u2013344 (2018)","DOI":"10.1007\/978-3-030-03807-6_12"},{"key":"18_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":"18_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Nir, O., Peter, N.: Better secret sharing via robust conditional disclosure of secrets. In: STOC 2020, pp. 280\u2013293 (2020)","DOI":"10.1145\/3357713.3384293"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Nir, O.: Upslices, downslices, and secret-sharing with complexity of 1.5$$ ^{\\text{n}}$$. In: CRYPTO 2021, vol. 12827, pp. 627\u2013655. Springer (2021)","DOI":"10.1007\/978-3-030-84252-9_21"},{"key":"18_CR6","unstructured":"Beimel, A.: Lower bounds for secret-sharing schemes for k-hypergraphs. In Kai-Min Chung, editor, ITC 2023, vol. 267. LIPIcs, pp. 16:1\u201316:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"18_CR7","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_CR8","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_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-98113-0_17","volume-title":"Security and Cryptography for Networks","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret-sharing schemes. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 313\u2013332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_17"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-45721-1_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Beimel","year":"2020","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret sharing with a small gap. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 529\u2013555. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_19"},{"key":"18_CR11","unstructured":"Benaloh, J., Rudich, S.: Private communication (1989)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: CRYPTO \u201988, vol. 403. LNCS, pp. 27\u201335 (1988)","DOI":"10.1007\/0-387-34799-2_3"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C Blundo","year":"1997","unstructured":"Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptography 11(2), 107\u2013122 (1997)","journal-title":"Des. Codes Cryptography"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Cachin, C.: On-line secret sharing. In: Proc. of the 5th IMA International Conference on Cryptography and Coding, vol. 1025. LNCS, pp. 190\u2013198 (1995)","DOI":"10.1007\/3-540-60693-9_22"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Chaudhury, S.S., Dutta, S., Sakurai, K.: Ac$$ ^{\\text{0 }}$$ constructions of secret sharing schemes - accommodating new parties. In: NSS 2020, vol. 12570. LNCS, pp. 292\u2013308 (2020)","DOI":"10.1007\/978-3-030-65745-1_17"},{"key":"18_CR17","unstructured":"Cheng, Q., Cao, H., Lin, S.-J., Yu, N.: A construction of evolving $$ k $$-threshold secret sharing scheme over a polynomial ring. arXiv preprint arXiv:2402.01144 (2024)"},{"issue":"3\u20134","key":"18_CR18","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."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Csirmaz, L.: The size of a share must be large. J. Cryptol. 10(4), 223\u2013231 (1997)","DOI":"10.1007\/s001459900029"},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10623-011-9540-y","volume":"63","author":"L Csirmaz","year":"2012","unstructured":"Csirmaz, L., Tardos, G.: On-line secret sharing. Des. Codes Cryptography 63(1), 127\u2013147 (2012)","journal-title":"On-line secret sharing. Des. Codes Cryptography"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2021.01.019","volume":"859","author":"P D\u2019Arco","year":"2021","unstructured":"D\u2019Arco, P., De Prisco, R., De Santis, A.: Secret sharing schemes for infinite sets of participants: a new design technique. Theor. Comput. Sci. 859, 149\u2013161 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR22","unstructured":"D\u2019Arco, P., De Prisco, R., De Santis, A., P\u00e9rez del Pozo, A., Vaccaro, U.: Probabilistic Secret Sharing. In: MFCS 2018, vol. 117. LIPIcs, pp. 64:1\u201364:16 (2018)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Dutta, S., Morozov, K.: Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing. In: Cryptology and Network Security, pp. 291\u2013307 (2019)","DOI":"10.1007\/978-3-030-31578-8_16"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Dutta, S., Roy, P.S., Fukushima, K., Kiyomoto, S., Sakurai, K.: Secret sharing on evolving multi-level access structure. In: Information Security Applications, pp. 180\u2013191 (2020)","DOI":"10.1007\/978-3-030-39303-8_14"},{"issue":"1\u20133","key":"18_CR25","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. Discret. Math. 170(1\u20133), 249\u2013251 (1997)","journal-title":"Discret. Math."},{"key":"18_CR26","unstructured":"Francati, D., Venturi, D.: Evolving secret sharing made short. Cryptology ePrint Archive, Paper 2023\/1534 (2023). https:\/\/eprint.iacr.org\/2023\/1534"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC \u201998, pp. 151\u2013160. Association for Computing Machinery, New York (1998)","DOI":"10.1145\/276698.276723"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 72(9), 56\u201364 (1989)","DOI":"10.1002\/ecjc.4430720906"},{"key":"18_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":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-53644-5_19","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2016","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to Share a Secret, Infinitely. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 485\u2013514. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_19"},{"issue":"6","key":"18_CR31","doi-asserted-by":"publisher","first-page":"4179","DOI":"10.1109\/TIT.2017.2779121","volume":"64","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. IEEE Trans. Inf. Theory 64(6), 4179\u20134190 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-70503-3_12","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Paskin-Cherniavsky, A.: Evolving secret sharing: dynamic thresholds and robustness. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 379\u2013393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_12"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 699\u2013708, New York, NY, USA. Association for Computing Machinery (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"18_CR34","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_CR35","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"},{"key":"18_CR36","unstructured":"Mazor, N.: A lower bound on the share size in evolving secret sharing. In: Chung, K.-M. (ed.) 4th Conference on Information-Theoretic Cryptography, ITC 2023, June 6-8, 2023, Aarhus University, Aarhus, Denmark, vol. 267. LIPIcs, pp. 2:1\u20132:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"18_CR37","unstructured":"Okamura, R., Koga, H.: New constructions of an evolving 2-threshold scheme based on binary or d-ary prefix codes. In: 2020 International Symposium on Information Theory and Its Applications (ISITA), pp. 432\u2013436 (2020)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Peter, N.: Evolving conditional disclosure of secrets. In: Information Security: 26th International Conference, ISC 2023, Groningen, The Netherlands, November 15\u201317, 2023, Proceedings, pp. 327\u2013347. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-49187-0_17"},{"key":"18_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-85987-9_5","volume-title":"Advances in Information and Computer Security","author":"K Phalakarn","year":"2021","unstructured":"Phalakarn, K., Suppakitpaisarn, V., Attrapadung, N., Matsuura, K.: Evolving homomorphic secret sharing for hierarchical access structures. In: Nakanishi, T., Nojima, R. (eds.) IWSEC 2021. LNCS, vol. 12835, pp. 77\u201396. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85987-9_5"},{"key":"18_CR40","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"},{"key":"18_CR41","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":"18_CR42","unstructured":"Sun, H.-M., Shieh, S.-P.: Secret sharing in graph-based prohibited structures. In: INFOCOM \u201997, pp. 718\u2013724. IEEE (1997)"},{"issue":"5","key":"18_CR43","doi-asserted-by":"publisher","first-page":"3718","DOI":"10.1109\/TIT.2024.3379278","volume":"70","author":"C Xing","year":"2024","unstructured":"Xing, C., Yuan, C.: Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes. IEEE Trans. Inf. Theory 70(5), 3718\u20133728 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"18_CR44","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1109\/TCOMM.2023.3253720","volume":"71","author":"W Yan","year":"2023","unstructured":"Yan, W., Lin, S.-J., Han, Y.S.: A new metric and the construction for evolving 2-threshold secret sharing schemes based on prefix coding of integers. IEEE Trans. Commun. 71(5), 2906\u20132915 (2023)","journal-title":"IEEE Trans. Commun."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:05:24Z","timestamp":1733137524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}