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 eavesdrop** 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 kee** 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
The datasets generated during and/or analysed during the current study are not publicly available but are available from the corresponding author on reasonable request.
References
Elhoseny M, Elminir H, Riad A et al (2016) A secure data routing schema for wsn using elliptic curve cryptography and homomorphic encryption. J King Saud Univ - Comput Inf Sci 28(3):262–275
Fukushima K, Kiyomoto S, Tanaka T et al (2008) Optimization of group key management structure with a client join-leave mechanism. Inf Process Manag 16:130–141
ISO/IEC:11770-5 (2011) Information technology - Security techniques - Key management - Part 5: Group key management
Je DH, Kim HS, Choi YH et al (2014) Dynamic configuration of batch rekeying interval for secure multicast service. In: 2014 International Conference on Computing. Networking and Communications (ICNC), IEEE, pp 26–30
Kumar V, Kumar R, Pandey SK (2020) A computationally efficient centralized group key distribution protocol for secure multicast communications based upon rsa public key cryptosystem. J King Saud Univ - Comput Inf Sci 32(9):1081–1094
Le Thi HA, Pham Dinh T (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res 133(1–4):23–46
Le Thi HA, Pham Dinh T (2018) DC programming and DCA: thirty years of developments. Math Program, Special Issue: DC Programming - Theory, Algorithms and Applications 169(1):5–68
Le Thi HA, Phan DN, Pham Dinh T (2021) DCA based approaches for bi-level variable selection and application for estimate multiple sparse covariance matrices. Neurocomputing 466:162–177
Li XS, Yang YR, Gouda MG, et al (2001) Batch rekeying for secure group communications. In: Proceedings of the 10th international conference on World Wide Web, pp 525–534
Morales L, Sudborough I, Eltoweissy M, et al (2003) Combinatorial optimization of multicast key management. In: Proceedings of the 36th Annual Hawaii International Conference on System Sciences, DOI 10.1109/HICSS.2003.1174906, 9 pages
Moyer MJ, Rao J, Rohatgi P (1999) Maintaining Balanced Key Trees for Secure Multicast. Internet-Draft draft-irtf-smug-key-tree-balance-00, Internet Engineering Task Force, https://datatracker.ietf.org/doc/html/draft-irtf-smug-key-tree-balance-00, 16 pages
Ng WHD, Howarth M, Sun Z et al (2007) Dynamic balanced key tree management for secure multicast communications. IEEE Trans Comput 56(5):590–605
Pegueroles J, Rico-Novella F (2003) Balanced batch lkh: new proposal, implementation and performance evaluation. In: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003, IEEE, pp 815–820
Pham Dinh T, Le Thi HA (1997) Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math Vietnam 22(1):289–355
Pham Dinh T, Le Thi HA (1998) A DC optimization algorithm for solving the trust-region subproblem. SIAM J Optim 8(2):476–505
Pham Dinh T, Le Thi HA (2014) Recent advances in DC programming and DCA. Transactions on computational intelligence XIII pp 1–37
Pham Dinh T, Nguyen CN, Le Thi HA (2010) An efficient combined DCA and B &B using DC/SDP relaxation for globally solving binary quadratic programs. J Glob Optim 48(4):595–632
Rudin W (1964) Principles of mathematical analysis, vol 3. McGraw-hill, New York
Sherman AT, McGrew DA (2003) Key establishment in large dynamic groups using one-way function trees. IEEE Trans Softw Eng 29(5):444–458
Vasudev C (2006) Graph theory with applications. New Age International, India
Vijayakumar P, Bose S, Kannan A (2012) Rotation based secure multicast key management for batch rekeying operations. Netw Sci 1(1–4):39–47
Wallner D, Harder E, Agee R et al (1999) Key management for multicast: Issues and architectures. Tech. rep, RFC, p 2627
Wong CK, Gouda M, Lam SS (2000) Secure group communications using key graphs. IEEE ACM Trans Netw 8(1):16–30
Yang YR, Li XS, Zhang XB, et al (2001) Reliable group rekeying: a performance analysis. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp 27–38
Zhang XB, Lam SS, Lee DY et al (2003) Protocol design for scalable and reliable group rekeying. IEEE ACM Trans Netw 11(6):908–922
Acknowledgements
The authors would like to thank the anonymous referees for their valuable comments and constructive suggestions, which have greatly helped to improve the presentation of this paper.
Funding
The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Contributions
HALT: Conceptualization, Methodology, Validation, Review & Editing, Supervision, Visualization. TTTN: Conceptualization, Data preparation, Methodology, Writing—Original Draft & Editing, Investigation, Numerical Experiments. HPHL: Methodology, Writing—Original Draft & Editing, Validation.
Corresponding author
Ethics declarations
Conflict of interest
The authors have no competing interests to declare that are relevant to the content of this article.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Le Thi, H.A., Nguyen, T.T.T. & Luu, H.P.H. A DC programming approach for solving a centralized group key management problem. J Comb Optim 44, 3165–3193 (2022). https://doi.org/10.1007/s10878-022-00862-1
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00862-1