{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:47:43Z","timestamp":1755794863149,"version":"3.44.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019127","type":"print"},{"value":"9783032019134","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-032-01913-4_5","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:42Z","timestamp":1755332562000},"page":"141-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Continuous Group-Key Agreement: Concurrent Updates Without Pruning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7553-6606","authenticated-orcid":false,"given":"Benedikt","family":"Auerbach","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2505-4246","authenticated-orcid":false,"given":"Miguel","family":"Cueto Noval","sequence":"additional","affiliation":[]},{"given":"Boran","family":"Erol","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9139-1654","authenticated-orcid":false,"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-90456-2_8","volume-title":"Theory of Cryptography","author":"J Alwen","year":"2021","unstructured":"Alwen, J., et al.: Grafting key trees: efficient key management for overlapping groups. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part III. LNCS, vol. 13044, pp. 222\u2013253. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_8"},{"key":"5_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-031-71073-5_14","volume-title":"Security and Cryptography for Networks","author":"J Alwen","year":"2024","unstructured":"Alwen, J., Auerbach, B., Cueto Noval, M., Klein, K., Pascual-Perez, G., Pietrzak, K.: DeCAF: decentralizable CGKA with fast healing. In: Galdi, C., Phan, D.H. (eds.) Security and Cryptography for Networks. LNCS, vol. 14974, pp. 294\u2013313. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71073-5_14"},{"key":"5_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/978-3-031-07085-3_28","volume-title":"EUROCRYPT 2022, Part II","author":"J Alwen","year":"2022","unstructured":"Alwen, J., Auerbach, B., Noval, M.C., Klein, K., Pascual-Perez, G., Pietrzak, K., Walter, M.: CoCoA: concurrent continuous group key agreement. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 815\u2013844. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_28"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-17653-2_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Alwen","year":"2019","unstructured":"Alwen, J., Coretti, S., Dodis, Y.: The double ratchet: security notions, proofs, and modularization for the signal protocol. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 129\u2013158. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_5"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-56784-2_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 248\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Modular design of secure group messaging protocols and the security of MLS. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1463\u20131483. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484820","DOI":"10.1145\/3460120.3484820"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-64378-2_10","volume-title":"Theory of Cryptography","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Jost, D., Mularczyk, M.: Continuous group key agreement with active security. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 261\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_10"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Alwen, J., Hartmann, D., Kiltz, E., Mularczyk, M.: Server-aided continuous group key agreement. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 69\u201382. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560632","DOI":"10.1145\/3548606.3560632"},{"key":"5_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-15979-4_2","volume-title":"CRYPTO 2022, Part II","author":"J Alwen","year":"2022","unstructured":"Alwen, J., Jost, D., Mularczyk, M.: On the insider security of MLS. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 34\u201368. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_2"},{"key":"5_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-031-38551-3_13","volume-title":"CRYPTO 2023, Part IV","author":"J Alwen","year":"2023","unstructured":"Alwen, J., Mularczyk, M., Tselekounis, Y.: Fork-resilient continuous group key agreement. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 396\u2013429. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_13"},{"key":"5_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-031-78011-0_14","volume-title":"TCC 2024, Part I","author":"M Anastos","year":"2024","unstructured":"Anastos, M., Auerbach, B., Baig, M.A., Noval, M.C., Kwan, M., Pascual-Perez, G., Pietrzak, K.: The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part I. LNCS, vol. 15364, pp. 413\u2013443. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78011-0_14"},{"key":"5_CR12","unstructured":"Auerbach, B., Noval, M.C., Erol, B., Pietrzak, K.: Continuous group-key agreement: Concurrent updates without pruning. Cryptology ePrint Archive, Paper 2025\/1035 (2025). https:\/\/eprint.iacr.org\/2025\/1035"},{"key":"5_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-031-48621-0_10","volume-title":"TCC 2023, Part III","author":"B Auerbach","year":"2023","unstructured":"Auerbach, B., Noval, M.C., Pascual-Perez, G., Pietrzak, K.: On the cost of post-compromise security in concurrent continuous group-key agreement. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part III. LNCS, vol. 14371, pp. 271\u2013300. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_10"},{"key":"5_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-981-99-8733-7_10","volume-title":"ASIACRYPT 2023, Part V","author":"D Balb\u00e1s","year":"2023","unstructured":"Balb\u00e1s, D., Collins, D., Gajland, P.: WhatsUpp with sender keys? Analysis, improvements and security proofs. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part V. LNCS, vol. 14442, pp. 307\u2013341. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_10"},{"key":"5_CR15","unstructured":"Balb\u00e1s, D., Collins, D., Vaudenay, S.: Cryptographic administration for secure group messaging. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 1253\u20131270. USENIX Association (2023)"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Barnes, R., Beurdouche, B., Robert, R., Millican, J., Omara, E., Cohn-Gordon, K.: The Messaging Layer Security (MLS) Protocol. RFC 9420 (2023). https:\/\/doi.org\/10.17487\/RFC9420","DOI":"10.17487\/RFC9420"},{"key":"5_CR17","unstructured":"Bhargavan, K., Barnes, R., Rescorla, E.: TreeKEM: Asynchronous Decentralized Key Management for Large Dynamic Groups (2018). https:\/\/mailarchive.ietf.org\/arch\/attach\/mls\/pdf1XUH6o.pdf"},{"key":"5_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-031-22365-5_8","volume-title":"TCC 2022, Part II","author":"A Bienstock","year":"2022","unstructured":"Bienstock, A., Dodis, Y., Garg, S., Grogan, G., Hajiabadi, M., R\u00f6sler, P.: On the worst-case inefficiency of CGKA. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part II. LNCS, vol. 13748, pp. 213\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_8"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-64378-2_8","volume-title":"Theory of Cryptography","author":"A Bienstock","year":"2020","unstructured":"Bienstock, A., Dodis, Y., R\u00f6sler, P.: On the price of concurrency in group ratcheting protocols. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 198\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_8"},{"key":"5_CR20","unstructured":"Brzuska, C., Cornelissen, E., Kohbrok, K.: Cryptographic security of the MLS RFC, draft 11. Cryptology ePrint Archive, Report 2021\/137 (2021). https:\/\/eprint.iacr.org\/2021\/137"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"5_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-031-54773-7_6","volume-title":"ACNS 2024, Part II","author":"K Cong","year":"2024","unstructured":"Cong, K., Eldefrawy, K., Smart, N.P., Terner, B.: The key lattice framework for concurrent group messaging. In: P\u00f6pper, C., Batina, L. (eds.) ACNS 2024, Part II. LNCS, vol. 14584, pp. 133\u2013162. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-54773-7_6"},{"key":"5_CR24","unstructured":"Cremers, C., G\u00fcnsay, E., Wesselkamp, V., Zhao, M.: ETK: external-operations TreeKEM and the security of MLS in RFC 9420. Cryptology ePrint Archive, Paper 2025\/229 (2025). https:\/\/eprint.iacr.org\/2025\/229"},{"key":"5_CR25","unstructured":"Cremers, C., Hale, B., Kohbrok, K.: The complexities of healing in secure group messaging: Why cross-group effects matter. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 1847\u20131864. USENIX Association (2021)"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Hashimoto, K., Katsumata, S., Postlethwaite, E., Prest, T., Westerbaan, B.: A concrete treatment of efficient continuous group key agreement via multi-recipient PKEs. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1441\u20131462. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484817","DOI":"10.1145\/3460120.3484817"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Hashimoto, K., Katsumata, S., Prest, T.: How to hide metadata in MLS-like secure group messaging: Simple, modular, and post-quantum. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922, New York, NY, USA, pp. 1399\u20131412. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3548606.3560679","DOI":"10.1145\/3548606.3560679"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Klein, K., et al.: Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement. In: 2021 IEEE Symposium on Security and Privacy (SP), Los Alamitos, CA, USA, pp. 268\u2013284. IEEE Computer Society (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00035","DOI":"10.1109\/SP40001.2021.00035"},{"key":"5_CR29","unstructured":"Wallez, T., Protzenko, J., Beurdouche, B., Bhargavan, K.: TreeSync: authenticated group management for messaging layer security. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 1217\u20131233. USENIX Association (2023)"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Wallner, D., Harder, E., Agee, R.: Key management for multicast: issues and architectures. Request for Comments: 2627, Internet Engineering Task Force (1999)","DOI":"10.17487\/rfc2627"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Weidner, M., Kleppmann, M., Hugenroth, D., Beresford, A.R.: Key agreement for decentralized secure group messaging with strong security guarantees. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021. pp. 2024\u20132045. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484542","DOI":"10.1145\/3460120.3484542"},{"key":"5_CR32","unstructured":"Weidner, M.: Group Messaging for Secure Asynchronous Collaboration. Master\u2019s thesis, University of Cambridge (2019)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01913-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:43Z","timestamp":1755332563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01913-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019127","9783032019134"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01913-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}