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

Queue-based Group Key Agreement Protocol

Group communication is exploding in Internet applications such as video conferences, online chatting programs, games, and gambling. Since most group communication takes place over the Internet that is a wide open network, security plays a major role. For a secure communication, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintain message integrity, all group members use a Group Key (GK) for encrypting and decrypting messages during group communication. Secure and efficient group key managements have been developed to generate a GK efficiently. Tree-based Group Diffie-Hellman (TGDH) is an efficient group key agreement protocol to generate the GK. TGDH and other group key generation protocols assume that all members have an equal computing power. However, one of the characteristics of a distributed computing environment is heterogeneity; the member can be at a workstation, a laptop, or even a mobile computer. TGDH and other group key generation protocols assume all members have an equal computing power. However, one of the characteristics of distributed computing is heterogeneity. Therefore, this research considers member’s diversity and proposes enhanced group key generation protocol with filtering out low performance members in group key generating processes to improve the efficiency of GK processes