Solving a Centralized Dynamic Group Key Management Problem by an Optimization Approach - Université de Lorraine Access content directly
Book Section Year : 2021

Solving a Centralized Dynamic Group Key Management Problem by an Optimization Approach

Abstract

In centralized key management schemes, a single trusted entity called a Key Server is employed to manage the group key and other supporting keys of the entire group. This management mechanism usually employs a binary tree based structure. In dynamic multicast communication, members may join/leave the group at any time, which requires a certain cost to update the binary key tree. This paper addresses an important problem in centralized dynamic group key management. It consists in finding a set of leaf nodes in a binary key tree to insert new members while minimizing the insertion cost. Since the inserting cost is proportional to the distance from the root to the selected leaf node, the balance of the tree plays an important role in dynamic group key management. Therefore, our proposed approach also considers the balance of the tree after insertion. The two mentioned important objectives are combined into a unified optimization framework.
No file

Dates and versions

hal-03565159 , version 1 (10-02-2022)

Identifiers

Cite

Thi Tuyet Trinh Nguyen, Hoang Phuc Hau Luu, Hoai An Le Thi. Solving a Centralized Dynamic Group Key Management Problem by an Optimization Approach. Modelling, Computation and Optimization in Information Systems and Management Sciences : proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021, 363, Springer International Publishing, pp.375-385, 2021, Lecture Notes in Networks and Systems, 978-3-030-92666-3, 978-3-030-92665-6. ⟨10.1007/978-3-030-92666-3_32⟩. ⟨hal-03565159⟩
75 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More