Open AccessClever Ant Colony System for Key Covering Problem in the Group Rekeying
Author(s) -
Seongsoo Hong,
Jianhua Adu,
Yunfei Zhang
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1920/1/012064
Subject(s) - rekeying , ant colony optimization algorithms , multicast , computer science , ant colony , key (lock) , heuristic , distributed computing , computer network , artificial intelligence , computer security , key management , encryption
The key covering problem (KCP) in the group rekeying for secure multicast communication is NP-Hard. We try to introduce the ant colony optimization (ACO) idea to solve the KCP, but the KCP can’t be solved directly by the existing ant algorithms. So we design a new kind of heuristic algorithm, called clever ant colony system (CACS), for the KCP. Firstly, we establish a map from a secure multicast group to an auxiliary key graph (AKG). Secondly, according to the idea of the ant colony system (ACS), we design the CACS over AKG. Finally, using simulation, we verify that the CACS is feasible and keeps high performance with a very short time.