Group Key Agreement in Information Centric Networks with Tree Group Diffie-Hellman

The client-server model is known to scale badly without redundant servers and caches. Information-Centric Networks (ICN) are an alternative designed to lessen that problem by distributing load to intermediary routers, lowering the bar to techniques only accessible to server farms. However, this seamlessness comes with its own set of problems. Communication security, by using a key per connection, prevents intermediaries from reading and thus caching content. We thus need to share a common key for larger groups of correspondents to be able to benefit from the advantages of ICN. This paper presents the algorithmic choices to establish such a group key, the adaptations made for ICN, its implementation, and the statistics backing its performances comparison with our baseline. The first results tend to show a performance improvement over the selected base algorithm.Comment: 4 pages, in French, 3 figures, submitted to CoRes 201