{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T10:48:51Z","timestamp":1776854931871,"version":"3.51.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:00:00Z","timestamp":1720656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:00:00Z","timestamp":1720656000000},"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":["Ann. Telecommun."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s12243-024-01053-1","type":"journal-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T05:01:40Z","timestamp":1720674100000},"page":"357-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discreet: distributed delivery service with context-aware cooperation"],"prefix":"10.1007","volume":"80","author":[{"given":"Ludovic","family":"Paillat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia-Lavinia","family":"Ignat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Frey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Turuani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amine","family":"Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"1053_CR1","unstructured":"Albouy T, Frey D, Gestin M et\u00a0al (2023) Context adaptive cooperation. https:\/\/arxiv.org\/abs\/2311.08776, 2311.08776"},{"key":"1053_CR2","doi-asserted-by":"publisher","unstructured":"Alwen J, Coretti S, Dodis Y et\u00a0al (2021) 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. Association for Computing Machinery, New York, NY, USA, CCS \u201921, p 1463\u20131483. https:\/\/doi.org\/10.1145\/3460120.3484820","DOI":"10.1145\/3460120.3484820"},{"key":"1053_CR3","doi-asserted-by":"publisher","unstructured":"Alwen J, Auerbach B, Noval MC et\u00a0al (2022) Cocoa: concurrent continuous group key agreement. In: Advances in cryptology \u2013 EUROCRYPT 2022: 41st annual international conference on the theory and applications of cryptographic techniques, Trondheim, Norway, May 30 \u2013 June 3, 2022, Proceedings, Part II. Springer-Verlag, Berlin, Heidelberg, p 815\u2013844. https:\/\/doi.org\/10.1007\/978-3-031-07085-3_28","DOI":"10.1007\/978-3-031-07085-3_28"},{"key":"1053_CR4","doi-asserted-by":"publisher","unstructured":"Ateniese G, Steiner M, Tsudik G (1998) Authenticated group key agreement and friends. In: Proceedings of the 5th ACM conference on computer and communications security, CCS \u201998, p 17\u201326. https:\/\/doi.org\/10.1145\/288090.288097","DOI":"10.1145\/288090.288097"},{"key":"1053_CR5","unstructured":"Balb\u00e1s D, Collins D, Gajland P (2022) Analysis and improvements of the sender keys protocol for group messaging. XVII Reuni\u00f3n espa\u00f1ola sobre criptolog\u00eda y seguridad de la informaci\u00f3n RECSI 2022 265:25. https:\/\/arxiv.org\/abs\/2301.07045"},{"key":"1053_CR6","doi-asserted-by":"publisher","unstructured":"Barnes R, Beurdouche B, Robert R et\u00a0al (2023) The Messaging Layer Security (MLS) protocol. RFC 9420. https:\/\/doi.org\/10.17487\/RFC9420","DOI":"10.17487\/RFC9420"},{"key":"1053_CR7","doi-asserted-by":"publisher","unstructured":"Bessani A, Sousa J, Alchieri EE (2014) State machine replication for the masses with BFT-smart. In: 2014 44th Annual IEEE\/IFIP international conference on dependable systems and networks, pp 355\u2013362. https:\/\/doi.org\/10.1109\/DSN.2014.43","DOI":"10.1109\/DSN.2014.43"},{"key":"1053_CR8","unstructured":"Beurdouche B, Rescorla E, Omara E et\u00a0al (2022) The Messaging Layer Security (MLS) architecture. Internet-Draft draft-ietf-mls-architecture-10, Internet engineering task force. https:\/\/datatracker.ietf.org\/doc\/draft-ietf-mls-architecture\/10\/, work in Progress"},{"key":"1053_CR9","unstructured":"Bhargavan K, Barnes R, Rescorla E (2018) TreeKEM: asynchronous decentralized key management for large dynamic groups A protocol proposal for Messaging Layer Security (MLS). Research report, Inria Paris. https:\/\/hal.inria.fr\/hal-02425247"},{"key":"1053_CR10","doi-asserted-by":"crossref","unstructured":"Bienstock A, Dodis Y, R\u00f6sler P (2020) On the price of concurrency in group ratcheting protocols. In: Pass R, Pietrzak K (eds) Theory of cryptography. Springer International Publishing, Cham, pp 198\u2013228. https:\/\/eprint.iacr.org\/2020\/1171","DOI":"10.1007\/978-3-030-64378-2_8"},{"issue":"2","key":"1053_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha G (1987) Asynchronous byzantine agreement protocols. Inf Comput 75(2):130\u2013143. https:\/\/doi.org\/10.1016\/0890-5401(87)90054-X","journal-title":"Inf Comput"},{"key":"1053_CR12","doi-asserted-by":"publisher","unstructured":"Brzuska C, Cornelissen E, Kohbrok K (2022) Security analysis of the MLS key derivation. In: 2022 IEEE Symposium on security and privacy (SP), pp 2535\u20132553. https:\/\/doi.org\/10.1109\/SP46214.2022.9833678","DOI":"10.1109\/SP46214.2022.9833678"},{"key":"1053_CR13","doi-asserted-by":"crossref","unstructured":"Burmester M, Desmedt Y (1995) A secure and efficient conference key distribution system. In: De\u00a0Santis A (ed) Advances in cryptology \u2014 EUROCRYPT\u201994. https:\/\/www.cs.fsu.edu\/~langley\/Eurocrypt\/euro-pre.pdf","DOI":"10.1007\/BFb0053443"},{"key":"1053_CR14","unstructured":"Castro M, Liskov B et\u00a0al (1999) Practical byzantine fault tolerance. In: 3rd Symposium on operating systems design and implementation (OSDI 99). USENIX Association, New Orleans, LA. https:\/\/www.usenix.org\/conference\/osdi-99\/practical-byzantine-fault-tolerance"},{"key":"1053_CR15","doi-asserted-by":"publisher","unstructured":"Cohn-Gordon K, Cremers C, Garratt L et\u00a0al (2018) On ends-to-ends encryption: asynchronous group messaging with strong security guarantees. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security. Association for Computing Machinery, New York, NY, USA, CCS \u201918, p 1802\u20131819. https:\/\/doi.org\/10.1145\/3243734.3243747","DOI":"10.1145\/3243734.3243747"},{"issue":"2","key":"1053_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382. https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J ACM"},{"key":"1053_CR17","unstructured":"Fromknecht C, Velicanu D, Yakoubov S (2014) A decentralized public key infrastructure with identity retention. IACR Cryptol ePrint Arch 2014:803. https:\/\/eprint.iacr.org\/2014\/803"},{"key":"1053_CR18","unstructured":"Guerraoui R, Kuznetsov P, Monti M et\u00a0al (2019) Scalable byzantine reliable broadcast (Extended Version). In: 33rd International symposium on distributed Computing (DISC 2019). https:\/\/arxiv.org\/abs\/1908.01738"},{"key":"1053_CR19","doi-asserted-by":"publisher","unstructured":"Kim Y, Perrig A, Tsudik G (2000) Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Proceedings of the 7th ACM conference on computer and communications security, CCS \u201900, p 235\u2013244. https:\/\/doi.org\/10.1145\/352600.352638","DOI":"10.1145\/352600.352638"},{"key":"1053_CR20","doi-asserted-by":"publisher","unstructured":"Klein K, Pascual-Perez G, Walter M et\u00a0al (2021) 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. https:\/\/doi.org\/10.1109\/SP40001.2021.00035","DOI":"10.1109\/SP40001.2021.00035"},{"key":"1053_CR21","doi-asserted-by":"crossref","unstructured":"Lamport L (2001) Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001) pp 51\u201358. https:\/\/www.microsoft.com\/en-us\/research\/publication\/paxos-made-simple\/","DOI":"10.1145\/568425.568433"},{"key":"1053_CR22","doi-asserted-by":"publisher","unstructured":"Malki D, Reiter M (1996) A high-throughput secure reliable multicast protocol. In: Proceedings 9th IEEE computer security foundations workshop, pp 9\u201317. https:\/\/doi.org\/10.1109\/CSFW.1996.503686","DOI":"10.1109\/CSFW.1996.503686"},{"key":"1053_CR23","unstructured":"Moxie M, Trevor P (2016) Signal - specifications - the x3dh key agreement protocol. https:\/\/signal.org\/docs\/specifications\/x3dh\/"},{"key":"1053_CR24","doi-asserted-by":"publisher","unstructured":"Nicolas M, Elvinger V, Oster G et\u00a0al (2017) MUTE: a peer-to-peer web-based real-time collaborative editor. In: ECSCW 2017 - 15th European conference on computer-supported cooperative work, Proceedings of 15th European conference on computer-supported cooperative work - panels, posters and demos, vol\u00a01. EUSSET, Sheffield, United Kingdom, pp 1\u20134. https:\/\/doi.org\/10.18420\/ecscw2017_p5","DOI":"10.18420\/ecscw2017_p5"},{"key":"1053_CR25","doi-asserted-by":"crossref","unstructured":"Paillat L, Ignat CL, Frey D et\u00a0al (2023) Design of an efficient distributed delivery service for group key agreement protocols. In: International symposium on foundations and practice of security. Springer","DOI":"10.1007\/978-3-031-57537-2_25"},{"key":"1053_CR26","unstructured":"Perrin T, Marlinspike M (2016) The double ratchet algorithm. Signal - Specifications. https:\/\/signal.org\/docs\/specifications\/doubleratchet\/"},{"key":"1053_CR27","doi-asserted-by":"crossref","unstructured":"Rault PA, Ignat CL, Perrin O (2023) Access control based on CRDTs for collaborative distributed applications. In: The International symposium on intelligent and trustworthy computing, communications, and networking (ITCCN-2023), Proceedings of the 22nd IEEE International conference on trust, security and privacy in computing and communications (TrustCom-2023), Exeter, UK. https:\/\/inria.hal.science\/hal-04224855","DOI":"10.1109\/TrustCom60117.2023.00187"},{"issue":"8","key":"1053_CR28","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/71.877936","volume":"11","author":"M Steiner","year":"2000","unstructured":"Steiner M, Tsudik G, Waidner M (2000) Key agreement in dynamic peer groups. IEEE Trans Parallel Distrib Syst 11(8):769\u2013780. https:\/\/doi.org\/10.1109\/71.877936","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1053_CR29","unstructured":"Wallez T, Protzenko J, Beurdouche B et\u00a0al (2023) Treesync: authenticated group management for messaging layer security. https:\/\/www.usenix.org\/system\/files\/sec23fall-prepub-372-wallez.pdf, prepublication 32nd Usenix Security Symposium"},{"key":"1053_CR30","unstructured":"Weidner M (2019) Group messaging for secure asynchronous collaboration. Master\u2019s thesis. https:\/\/mattweidner.com\/assets\/pdf\/acs-dissertation.pdf"},{"key":"1053_CR31","doi-asserted-by":"publisher","unstructured":"Weidner M, Kleppmann M, Hugenroth D et\u00a0al (2021) Key agreement for decentralized secure group messaging with strong security guarantees. In: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security. Association for Computing Machinery, New York, NY, USA, CCS \u201921, p 2024\u20132045. https:\/\/doi.org\/10.1145\/3460120.3484542","DOI":"10.1145\/3460120.3484542"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-024-01053-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-024-01053-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-024-01053-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T06:58:29Z","timestamp":1741676309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-024-01053-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,11]]},"references-count":31,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1053"],"URL":"https:\/\/doi.org\/10.1007\/s12243-024-01053-1","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,11]]},"assertion":[{"value":"15 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}