{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T22:45:05Z","timestamp":1745621105955,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T00:00:00Z","timestamp":1651795200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T00:00:00Z","timestamp":1651795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00862-1","type":"journal-article","created":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T18:28:56Z","timestamp":1651861736000},"page":"3165-3193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A DC programming approach for solving a centralized group key management problem"],"prefix":"10.1007","volume":"44","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Thi Tuyet Trinh","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0908-9817","authenticated-orcid":false,"given":"Hoang Phuc Hau","family":"Luu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"issue":"3","key":"862_CR1","first-page":"262","volume":"28","author":"M Elhoseny","year":"2016","unstructured":"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\u2013275","journal-title":"J King Saud Univ - Comput Inf Sci"},{"key":"862_CR2","first-page":"130","volume":"16","author":"K Fukushima","year":"2008","unstructured":"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\u2013141","journal-title":"Inf Process Manag"},{"key":"862_CR3","unstructured":"ISO\/IEC:11770-5 (2011) Information technology - Security techniques - Key management - Part 5: Group key management"},{"key":"862_CR4","doi-asserted-by":"crossref","unstructured":"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\u201330","DOI":"10.1109\/ICCNC.2014.6785299"},{"issue":"9","key":"862_CR5","first-page":"1081","volume":"32","author":"V Kumar","year":"2020","unstructured":"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\u20131094","journal-title":"J King Saud Univ - Comput Inf Sci"},{"issue":"1\u20134","key":"862_CR6","first-page":"23","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"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\u20134):23\u201346","journal-title":"Ann Oper Res"},{"key":"862_CR7","doi-asserted-by":"crossref","unstructured":"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\u201368","DOI":"10.1007\/s10107-018-1235-y"},{"key":"862_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.neucom.2021.09.039","volume":"466","author":"HA Le Thi","year":"2021","unstructured":"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\u2013177","journal-title":"Neurocomputing"},{"key":"862_CR9","doi-asserted-by":"crossref","unstructured":"Li XS, Yang YR, Gouda MG, et\u00a0al (2001) Batch rekeying for secure group communications. In: Proceedings of the 10th international conference on World Wide Web, pp 525\u2013534","DOI":"10.1145\/371920.372153"},{"key":"862_CR10","doi-asserted-by":"crossref","unstructured":"Morales L, Sudborough I, Eltoweissy M, et\u00a0al (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","DOI":"10.1109\/HICSS.2003.1174906"},{"key":"862_CR11","unstructured":"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"},{"issue":"5","key":"862_CR12","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/TC.2007.1022","volume":"56","author":"WHD Ng","year":"2007","unstructured":"Ng WHD, Howarth M, Sun Z et al (2007) Dynamic balanced key tree management for secure multicast communications. IEEE Trans Comput 56(5):590\u2013605","journal-title":"IEEE Trans Comput"},{"key":"862_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013820","DOI":"10.1109\/ISCC.2003.1214218"},{"issue":"1","key":"862_CR14","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh T, Le Thi HA (1997) Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math Vietnam 22(1):289\u2013355","journal-title":"Acta Math Vietnam"},{"issue":"2","key":"862_CR15","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh T, Le Thi HA (1998) A DC optimization algorithm for solving the trust-region subproblem. SIAM J Optim 8(2):476\u2013505","journal-title":"SIAM J Optim"},{"key":"862_CR16","doi-asserted-by":"crossref","unstructured":"Pham\u00a0Dinh T, Le\u00a0Thi HA (2014) Recent advances in DC programming and DCA. Transactions on computational intelligence XIII pp 1\u201337","DOI":"10.1007\/978-3-642-54455-2_1"},{"issue":"4","key":"862_CR17","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T Pham Dinh","year":"2010","unstructured":"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\u2013632","journal-title":"J Glob Optim"},{"key":"862_CR18","volume-title":"Principles of mathematical analysis","author":"W Rudin","year":"1964","unstructured":"Rudin W (1964) Principles of mathematical analysis, vol 3. McGraw-hill, New York"},{"issue":"5","key":"862_CR19","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/TSE.2003.1199073","volume":"29","author":"AT Sherman","year":"2003","unstructured":"Sherman AT, McGrew DA (2003) Key establishment in large dynamic groups using one-way function trees. IEEE Trans Softw Eng 29(5):444\u2013458","journal-title":"IEEE Trans Softw Eng"},{"key":"862_CR20","volume-title":"Graph theory with applications","author":"C Vasudev","year":"2006","unstructured":"Vasudev C (2006) Graph theory with applications. New Age International, India"},{"issue":"1\u20134","key":"862_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s13119-011-0001-8","volume":"1","author":"P Vijayakumar","year":"2012","unstructured":"Vijayakumar P, Bose S, Kannan A (2012) Rotation based secure multicast key management for batch rekeying operations. Netw Sci 1(1\u20134):39\u201347","journal-title":"Netw Sci"},{"key":"862_CR22","doi-asserted-by":"crossref","unstructured":"Wallner D, Harder E, Agee R et al (1999) Key management for multicast: Issues and architectures. Tech. rep, RFC, p 2627","DOI":"10.17487\/rfc2627"},{"issue":"1","key":"862_CR23","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/90.836475","volume":"8","author":"CK Wong","year":"2000","unstructured":"Wong CK, Gouda M, Lam SS (2000) Secure group communications using key graphs. IEEE ACM Trans Netw 8(1):16\u201330","journal-title":"IEEE ACM Trans Netw"},{"key":"862_CR24","doi-asserted-by":"crossref","unstructured":"Yang YR, Li XS, Zhang XB, et\u00a0al (2001) Reliable group rekeying: a performance analysis. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp 27\u201338","DOI":"10.1145\/383059.383062"},{"issue":"6","key":"862_CR25","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TNET.2003.820256","volume":"11","author":"XB Zhang","year":"2003","unstructured":"Zhang XB, Lam SS, Lee DY et al (2003) Protocol design for scalable and reliable group rekeying. IEEE ACM Trans Netw 11(6):908\u2013922","journal-title":"IEEE ACM Trans Netw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00862-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00862-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00862-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:38:42Z","timestamp":1667036322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00862-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,6]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["862"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00862-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,5,6]]},"assertion":[{"value":"11 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}