{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T07:25:32Z","timestamp":1766647532498,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609406"},{"type":"electronic","value":"9789819609413"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0941-3_3","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T13:35:20Z","timestamp":1733664920000},"page":"69-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Evolving Secret Sharing Made Short"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4639-0636","authenticated-orcid":false,"given":"Danilo","family":"Francati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2379-8564","authenticated-orcid":false,"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Alon, B., Beimel, A., David, T.B., Omri, E., Paskin-Cherniavsky, A.: New upper bounds for evolving secret sharing via infinite branching programs. Cryptology ePrint Archive (2024), https:\/\/eprint.iacr.org\/2024\/419","DOI":"10.1007\/978-3-031-78023-3_18"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Beimel, A., Ishai, Y., Kushilevitz, E., Liu, T., Vaikuntanathan, V.: Succinct computational secret sharing. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. pp. 1553\u20131566 (2023). https:\/\/doi.org\/10.1145\/3564246.3585127","DOI":"10.1145\/3564246.3585127"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Nir, O.: Upslices, downslices, and secret-sharing with complexity of $${1.5}^n$$. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0III. LNCS, vol. 12827, pp. 627\u2013655. Springer, Heidelberg, Virtual Event (Aug 2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_21","DOI":"10.1007\/978-3-030-84252-9_21"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT\u00a02011. LNCS, vol.\u00a07073, pp. 590\u2013609. Springer, Heidelberg (Dec 2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_32","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"B\u00e9guin, P., Cresti, A.: General short computational secret sharing schemes. In: Guillou, L.C., Quisquater, J.J. (eds.) EUROCRYPT\u201995. LNCS, vol.\u00a0921, pp. 194\u2013208. Springer, Heidelberg (May 1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_16","DOI":"10.1007\/3-540-49264-X_16"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Beimel, A.: Secret-sharing schemes: A survey. In: Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings. vol.\u00a06639, pp. 11\u201346. Springer (2011)","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Beimel, A., Farr\u00e0s, O., Mintz, Y.: Secret-sharing schemes for very dense graphs. Journal of Cryptology 29(2), 336\u2013362 (Apr 2016). https:\/\/doi.org\/10.1007\/s00145-014-9195-8","DOI":"10.1007\/s00145-014-9195-8"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret-sharing schemes. In: Catalano, D., De Prisco, R. (eds.) SCN 18. LNCS, vol. 11035, pp. 313\u2013332. Springer, Heidelberg (Sep 2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_17","DOI":"10.1007\/978-3-319-98113-0_17"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret sharing with a small gap. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 529\u2013555. Springer, Heidelberg (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_19","DOI":"10.1007\/978-3-030-45721-1_19"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. In: Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005. Proceedings 2. pp. 600\u2013619. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_32","DOI":"10.1007\/978-3-540-30576-7_32"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference 48, 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Guo, S., Komargodski, I.: Threshold secret sharing requires a linear-size alphabet. Theory of Computing 16(1), 1\u201318 (2020)","DOI":"10.4086\/toc.2020.v016a002"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Cachin, C.: On-line secret sharing. In: Boyd, C. (ed.) 5th IMA International Conference on Cryptography and Coding. LNCS, vol.\u00a01025, pp. 190\u2013198. Springer, Heidelberg (Dec 1995)","DOI":"10.1007\/3-540-60693-9_22"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Csirmaz, L.: The size of a share must be large. In: Santis, A.D. (ed.) EUROCRYPT\u201994. LNCS, vol.\u00a0950, pp. 13\u201322. Springer, Heidelberg (May 1995). https:\/\/doi.org\/10.1007\/BFb0053420","DOI":"10.1007\/BFb0053420"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Csirmaz, L.: The size of a share must be large. In: Santis, A.D. (ed.) EUROCRYPT\u201994. LNCS, vol.\u00a0950, pp. 13\u201322. Springer, Heidelberg (May 1995). https:\/\/doi.org\/10.1007\/BFb0053420","DOI":"10.1007\/BFb0053420"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Csirmaz, L., Tardos, G.: On-line secret sharing. Des. Codes Cryptogr. 63(1), 127\u2013147 (2012)","DOI":"10.1007\/s10623-011-9540-y"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Dutta, S., Morozov, K.: Evolving perfect hash families: A combinatorial viewpoint of evolving secret sharing. In: Mu, Y., Deng, R.H., Huang, X. (eds.) CANS 19. LNCS, vol. 11829, pp. 291\u2013307. Springer, Heidelberg (Oct 2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_16","DOI":"10.1007\/978-3-030-31578-8_16"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Dutta, S., Roy, P.S., Fukushima, K., Kiyomoto, S., Sakurai, K.: Secret sharing on evolving multi-level access structure. In: You, I. (ed.) WISA 19. LNCS, vol. 11897, pp. 180\u2013191. Springer, Heidelberg (Aug 2019). https:\/\/doi.org\/10.1007\/978-3-030-39303-8_14","DOI":"10.1007\/978-3-030-39303-8_14"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Faonio, A., Venturi, D.: Non-malleable secret sharing in the computational setting: Adaptive tampering, noisy-leakage resilience, and improved rate. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0II. LNCS, vol. 11693, pp. 448\u2013479. Springer, Heidelberg (Aug 2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_16","DOI":"10.1007\/978-3-030-26951-7_16"},{"key":"3_CR20","unstructured":"Francati, D., Venturi, D.: Evolving secret sharing made short. Cryptology ePrint Archive (2023), https:\/\/eprint.iacr.org\/2023\/1534"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC. pp. 685\u2013698. ACM Press (Jun 2018). https:\/\/doi.org\/10.1145\/3188745.3188872","DOI":"10.1145\/3188745.3188872"},{"key":"3_CR22","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. IEEE Global Telecommunication Conf. (Globecom\u201987). pp. 99\u2013102 (1987)"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Jafargholi, Z., Kamath, C., Klein, K., Komargodski, I., Pietrzak, K., Wichs, D.: Be adaptive, avoid overcommitting. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0I. LNCS, vol. 10401, pp. 133\u2013163. Springer, Heidelberg (Aug 2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_5","DOI":"10.1007\/978-3-319-63688-7_5"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. In: Hirt, M., Smith, A.D. (eds.) TCC\u00a02016-B, Part\u00a0II. LNCS, vol.\u00a09986, pp. 485\u2013514. Springer, Heidelberg (Oct\u00a0\/\u00a0Nov 2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_19","DOI":"10.1007\/978-3-662-53644-5_19"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Secret-sharing for NP. Journal of Cryptology 30(2), 444\u2013469 (Apr 2017). https:\/\/doi.org\/10.1007\/s00145-015-9226-0","DOI":"10.1007\/s00145-015-9226-0"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Komargodski, I., Paskin-Cherniavsky, A.: Evolving secret sharing: Dynamic thresholds and robustness. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017, Part\u00a0II. LNCS, vol. 10678, pp. 379\u2013393. Springer, Heidelberg (Nov 2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_12","DOI":"10.1007\/978-3-319-70503-3_12"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO\u201993. LNCS, vol.\u00a0773, pp. 136\u2013146. Springer, Heidelberg (Aug 1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_12","DOI":"10.1007\/3-540-48329-2_12"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Luby, M.: Lt codes. In: 43rd FOCS. pp. 271\u2013282. IEEE Computer Society Press (Nov 2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181950","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A.: Efficient erasure correcting codes. IEEE Trans. Inf. Theory 47(2), 569\u2013584 (2001)","DOI":"10.1109\/18.910575"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Mazor, N.: A lower bound on the share size in evolving secret sharing. In: 4th Conference on Information-Theoretic Cryptography (ITC 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2023.2","DOI":"10.4230\/LIPIcs.ITC.2023.2"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Digital fountains: a survey and look forward. In: 2004 IEEE Information Theory Workshop, San Antonio, TX, USA, 24-29 October, 2004. pp. 271\u2013276. IEEE (2004)","DOI":"10.1109\/ITW.2004.1405313"},{"key":"3_CR32","unstructured":"Paskin-Cherniavsky, A.: How to infinitely share a secret more efficiently. Cryptology ePrint Archive, Report 2016\/1088 (2016), https:\/\/eprint.iacr.org\/2016\/1088"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Pueyo, I.C., Cramer, R., Xing, C.: Bounds on the threshold gap in secret sharing and its applications. IEEE Trans. Inf. Theory 59(9), 5600\u20135612 (2013)","DOI":"10.1109\/TIT.2013.2264504"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC. pp. 73\u201385. ACM Press (May 1989). https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Communications of the Association for Computing Machinery 22(11), 612\u2013613 (Nov 1979)","DOI":"10.1145\/359168.359176"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Shokrollahi, M.A., Luby, M.: Raptor codes. Found. Trends Commun. Inf. Theory 6(3-4), 213\u2013322 (2009)","DOI":"10.1561\/0100000060"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Vinod, V., Narayanan, A., Srinathan, K., Rangan, C.P., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT\u00a02003. LNCS, vol.\u00a02904, pp. 162\u2013176. Springer, Heidelberg (Dec 2003)","DOI":"10.1007\/978-3-540-24582-7_12"},{"key":"3_CR38","unstructured":"Xing, C., Yuan, C.: Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes. Cryptology ePrint Archive, Report 2021\/1115 (2021), https:\/\/eprint.iacr.org\/2021\/1115"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0941-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T14:02:05Z","timestamp":1733666525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0941-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609406","9789819609413"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0941-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}