A DC programming approach for solving a centralized group key management problem

Hoai An Le Thi (), Thi Tuyet Trinh Nguyen () and Hoang Phuc Hau Luu ()
Additional contact information
Hoai An Le Thi: Université de Lorraine
Thi Tuyet Trinh Nguyen: Université de Lorraine
Hoang Phuc Hau Luu: Université de Lorraine

Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 1, 3165-3193

Abstract: Abstract A single trusted entity known as a Key Server is in charge of key generation, distribution, and management in centralized key management schemes. To prevent eavesdropping and protect the exchange content, a group key is used to encrypt the group communication. This management mechanism is typically based on a binary tree structure. When the membership of a group changes dynamically, the group key must be changed, triggering a certain updated cost. 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 with minimal insertion cost and keeping the tree as balanced as possible. The two mentioned important objectives are combined into a unified (deterministic) optimization model whose objective function contains discontinuous step functions with binary variables, which is known to be NP-hard. We then reformulate the problem as a combinatorial optimization program with continuous objective by introducing new binary variables. Applying penalty techniques, it results in a standard DC (Difference of Convex functions) program that can be solved efficiently by DCA (DC algorithm). Besides, the insertion nodes must be the leaf nodes, we introduce a two-step algorithm to reduce the model complexity: the first is to find the set of leaf nodes, while the second is to solve the simplified optimization problem. Numerical experiments have been studied intensively to justify the merit of our proposed model as well as the corresponding DCA.

Keywords: Centralized group key management; DC programming; DCA; Combinatorial optimization (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00862-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00862-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00862-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().