{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:32:13Z","timestamp":1754159533543,"version":"3.41.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031957604"},{"type":"electronic","value":"9783031957611"}],"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-031-95761-1_20","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T09:30:11Z","timestamp":1750498211000},"page":"572-595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tighter Provable Security for\u00a0TreeKEM"],"prefix":"10.1007","author":[{"given":"Karen","family":"Azari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Ellison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"20_CR1","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: DHIES: an encryption scheme based on the Diffie-Hellman problem (1998). https:\/\/cseweb.ucsd.edu\/~mihir\/papers\/dhies.pdf"},{"key":"20_CR2","doi-asserted-by":"publisher","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. LNCS, vol. 12170, pp. 248\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9","DOI":"10.1007\/978-3-030-56784-2_9"},{"key":"20_CR3","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: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 1463\u20131483. CCS 2021, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3460120.3484820","DOI":"10.1145\/3460120.3484820"},{"key":"20_CR4","unstructured":"Azari, K., Ellison, A.: Tighter provable security for TreeKEM. Cryptology ePrint Archive, Paper 2024\/1878 (2024). https:\/\/eprint.iacr.org\/2024\/1878"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Balb\u00e1s, D., Collins, D., Gajland, P.: WhatsUpp with sender keys? Analysis, improvements and security proofs. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023, pp. 307\u2013341. Springer Nature Singapore, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_10","DOI":"10.1007\/978-981-99-8733-7_10"},{"key":"20_CR6","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, https:\/\/www.rfc-editor.org\/info\/rfc9420","DOI":"10.17487\/RFC9420"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. CCS 1993, Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"20_CR8","unstructured":"Bhargavan, K., Barnes, R., Rescorla, E.: TreeKEM: asynchronous decentralized key management for large dynamic groups a protocol proposal for messaging layer security (MLS). Research report, Inria Paris (2018). https:\/\/inria.hal.science\/hal-02425247"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Cohn-Gordon, K., Cremers, C., Dowling, B., Garratt, L., Stebila, D.: A formal security analysis of the signal messaging protocol. In: 2017 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 451\u2013466 (2017). https:\/\/doi.org\/10.1109\/EuroSP.2017.27","DOI":"10.1109\/EuroSP.2017.27"},{"key":"20_CR10","unstructured":"Hogben, G.: An important step towards secure and interoperable messaging (2023). https:\/\/security.googleblog.com\/2023\/07\/an-important-step-towards-secure-and.html. Accessed 1 Nov 2023"},{"key":"20_CR11","unstructured":"IETF: Support for MLS (2023). https:\/\/www.ietf.org\/blog\/support-for-mls-2023\/. Accessed 1 Nov 2023"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Third Edition. Chapman & Hall\/CRC, 3rd edn. (2020)","DOI":"10.1201\/9781351133036"},{"key":"20_CR13","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), pp. 268\u2013284 (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00035","DOI":"10.1109\/SP40001.2021.00035"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-70936-7_2","volume-title":"Theory of Cryptography","author":"S Panjwani","year":"2007","unstructured":"Panjwani, S.: Tackling adaptive corruptions in multicast encryption protocols. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 21\u201340. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_2"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Pascual\u00a0Perez, G.: On the efficiency and security of secure group messaging. Ph.D. thesis, Institute of Science and Technology Austria (2024). https:\/\/doi.org\/10.15479\/at:ista:18088","DOI":"10.15479\/at:ista:18088"},{"key":"20_CR16","unstructured":"Perrin, T., Marlinspike, M.: The double ratchet algorithm (2016). https:\/\/signal.org\/docs\/specifications\/doubleratchet\/. Accessed 5 Mar 2024"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95761-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T14:36:46Z","timestamp":1753454206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95761-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957604","9783031957611"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95761-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 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":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}