A survey on optimization-based approaches to Dynamic Centralized Group Key management
DOI:
https://doi.org/10.54654/isj.v3i20.952Keywords:
Centralized group key management, Rekeying, DC Programming, DCA, combinatorial optimization.Tóm tắt
Abstract—In secure multicast communication, only authorized group members are able to receive the transmitted data. Key generation, distribution, and management are all carried out by a single entity (called the Key Server) in the centralized system. The main challenges of a dynamic centralized group key management scheme include scalability overhead, rekeying overhead, storage overhead, maintaining forward and backward secrecy, etc. Logical Key Hierarchy (LKH), one of the key management methods, uses a tree structure to manage keys to share with participants. Due to the fact that members may join or exit the group at any time during communication, a crucial problem in centralized group key management (CGKM) is minimizing rekeying costs while maintaining a balanced tree. The majority of CGKM methods effectively update the group key by modifying cryptographic techniques or based on logical/heuristic arguments. One of the efficient approaches is based on an optimization model with the two mentioned important objectives. In this paper, we conduct a survey on optimization-based approaches to dynamic CGKM, which can be divided into two categories based on logical/heuristic arguments and a rigorous mathematical optimization model.
Downloads
References
D. Wallner, E. Harder, R. Agee et al., “Key management for multicast: Issues and architectures,” RFC 2627, Tech. Rep., 1999.
C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key graphs,” IEEE/ACM transactions on networking, vol. 8, no. 1, pp. 16–30, 2000.
M. J. Moyer, J. Rao, and P. Rohatgi, “Maintaining Balanced Key Trees for Secure Multicast,” Internet Engineering Task Force, Internet-Draft, 1999, 16 pages. [Online]. Available:
https://datatracker.ietf.org/doc/html/draft-irtf-smug-key-tree-balance-00
ISO/IEC:11770-5, “Information technology - Security techniques – Key management - Part 5: Group key management,” 2021.
X. S. Li, Y. R. Yang, M. G. Gouda, and S. S. Lam, “Batch rekeying for secure group communications,” in Proceedings of the 10th international conference on World Wide Web, 2001, pp. 525–534.
L. Morales, I. Sudborough, M. Eltoweissy, and M. Heydari, “Combinatorial optimization of multicast key management,” in Proceedings of the 36th Annual Hawaii International Conference on System Sciences. IEEE, 2003.
W. H. D. Ng, M. Howarth, Z. Sun, and H. Cruickshank, “Dynamic balanced key tree management for secure multicast communications,” IEEE Trans Comput, vol. 56, no. 5, pp. 590–605, 2007.
K. Fukushima, S. Kiyomoto, T. Tanaka, and K. Sakurai, “Optimization of group key management structure with a client join-leave mechanism,” Journal of Information Processing, vol. 16, pp. 130–141, 2008.
P. Vijayakumar, S. Bose, and A. Kannan, “Rotation based secure multicast key management for batch rekeying operations,” Netw Sci, vol. 1, no. 1-4, pp. 39–47, 2012.
D.-H. Je, H.-S. Kim, Y.-H. Choi, and S.-W. Seo, “Dynamic configuration of batch rekeying interval for secure multicast service,” in 2014 International Conference on Computing, Networking and Communications (ICNC). IEEE, 2014, pp. 26–30.
A. T. Sherman and D. A. McGrew, “Key establishment in large dynamic groups using one-way function trees,” IEEE transactions on Software Engineering, vol. 29, no. 5, pp. 444–458, 2003.
J. Goshi and R. E. Ladner, “Algorithms for dynamic multicast key distribution trees,” in Proceedings of the twenty-second annual symposium on Principles of distributed computing, 2003, pp. 243–251.
H. Lu, “A novel high-order tree for secure multicast key management,” IEEE Transactions on Computers, vol. 54, no. 2, pp. 214–224, 2005.
H.-Y. Lin, M.-Y. Hsieh, and K.-C. Li, “The cluster-based key management mechanism with secure data transmissions scheme in wireless sensor networks,” DEStech Transactions on Engineering and Technology Research, AMMA, 2017.
S. H. Islam and G. Biswas, “A pairing-free identity-based two-party authenticated key agreement protocol for secure and efficient communication,” Journal of King Saud University-Computer and Information
Sciences, vol. 29, no. 1, pp. 63–73, 2017.
V. Kumar, R. Kumar, and S. K. Pandey, “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, vol. 32, no. 9, pp. 1081–1094, 2020.
T. T. T. Nguyen, H. P. H. Luu, and H. A. Le Thi, “Solving a centralized dynamic group key management problem by an optimization approach,” in 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 4. Springer, 2022, pp. 375–385.
H. A. Le Thi, T. T. T. Nguyen, and H. P. H. Luu, “A DC programming approach for solving a centralized group key management problem,”
Journal of Combinatorial Optimization, vol. 44, no. 5, pp. 3165–3193, 2022.
H. A. Le Thi and T. T. T. Nguyen, “Solving the problem of batch deletion and insertion members in the logical key hierarchy structure
by a DC programming approach,” arXiv, 2023. [Online]. Available: https://doi.org/10.48550/arXiv.2305.10131
T. Pham Dinh, C. N. Nguyen, and H. A. Le Thi, “An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary
quadratic programs,” J Glob Optim, vol. 48, no. 4, pp. 595–632, 2010.
T. Pham Dinh and H. A. Le Thi, “Convex analysis approach to DC programming: theory, algorithms and applications,” Acta Math. Vietnam., vol. 22, no. 1, pp. 289–355, 1997.
T. Pham Dinh and H. A. Le Thi, “A DC optimization algorithm for solving the trust-region subproblem,” SIAM J. Optim., vol. 8, no. 2, pp. 476–505, 1998.
H. A. Le Thi and T. Pham Dinh, “The DC (difference of convex functions) programming and DCA revisited with DC models of real
world nonconvex optimization problems,” Ann. Oper. Res., vol. 133, no.1-4, pp. 23–46, 2005.
T. Pham Dinh and H. A. Le Thi, “Recent advances in DC programming and DCA,” Transactions on computational intelligence XIII, pp. 1–37, 2014.
H. A. Le Thi and T. Pham Dinh, “DC programming and DCA: thirty years of developments,” Math. Program., Special Issue dedicated to: DC Programming - Theory, Algorithms and Applications, vol. 169, no. 1,
pp. 5–68, 2018.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
