Xiaohui Kuang

Xiaohui Kuang


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 July 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
Tao ZhangTao Zhang
Tao Zhang
Changqiao XuChangqiao Xu
Changqiao Xu
PZPing Zou
Ping Zou
HTHaijiang Tian
Haijiang Tian
XKXiaohui Kuang
Xiaohui Kuang
DNDusit Niyato
Dusit Niyato
Software defined Internet of Vehicles (SD-IoV) is an emerging paradigm for accomplishing Industrial Internet of Things (IIoT). Unfortunately, SD-IoV still faces security challenges. Traditional solutions respond after attacks happening, which is low-effective. To cope with this problem, moving target defense (MTD) was proposed to modify network configurations dynamically. However, current MTD for IIoT has several drawbacks: 1) it cannot handle highly dynamic environments; 2) MTD strategy lacks intelligence because it needs attack–defense models; 3) they are difficult to trace sources. In this article, we propose an intelligent MTD scheme to defend against distributed denial-of-service in SD-IoV. Firstly, we model the configuration mutation of roadside units as a Markov decision process (MDP), and adopt deep reinforcement learning to solve the optimal configuration. Next, we evaluate the trust of vehicles after shuffling, which can distinguish spy vehicles. Finally, extensive simulation results confirm the effectiveness of our solution compared with representative methods.

30 August 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Tao ZhangTao Zhang
Tao Zhang
Changqiao XuChangqiao Xu
Changqiao Xu
YLYibo Lian
Yibo Lian
HTHaijiang Tian
Haijiang Tian
JKJiawen Kang
Jiawen Kang
DNDusit Niyato
Dusit Niyato
With rapid development of emerging technologies for Internet of Things (IoT), digital twins (DT) have been proposed to support a wide variety of applications. A mobile network is expected to be integrated with DT to form a DT mobile network (DTMN). Unfortunately, DTMN still faces security threats, which have attracted great research attention. Current defense mechanisms are mostly static, i.e., responding after attacks happening. To solve the aforementioned problem, moving target defense (MTD) has been proposed as an innovative solution. However, there exist three major challenges when applying MTD into DTMN. Firstly, less emphasis was paid to collaborative scheduling between multiple MTD schemes, which can improve the security of DTMN. Secondly, MTD schemes require lots of network resources, but few works focus on the time allocation of multiple MTD schemes to reduce network resource consumption. Thirdly, existing defense strategies only rely on current information, but do not consider future information. In this paper, we propose a collaborative mutation-based MTD (CM-MTD) in DTMN. We mainly consider two MTD schemes called host address mutation (HAM) and route mutation (RM), respectively, which adjust network properties and invalidate different stages of cyber kill chain. We firstly formulate a semi-Markov decision process (SMDP) to model time-varying security events and dynamic deployment of multiple MTD schemes. Then, security events are predicted by long short-term memory (LSTM), which are regarded as network states in SMDP. Next, infeasible actions that do not satisfy network constraints will be removed from the action space of the SMDP. Lastly, we design a hierarchical deep reinforcement learning algorithm for collaborative scheduling. Simulation results highlight the effectiveness of CM-MTD compared with baseline solutions.

11 September 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
Tao ZhangTao Zhang
Tao Zhang
Changqiao XuChangqiao Xu
Changqiao Xu
JSJiahao Shen
Jiahao Shen
XKXiaohui Kuang
Xiaohui Kuang
LGLuigi Alfredo Grieco
Luigi Alfredo Grieco
With the explosive growth of Internet traffic, large sensitive and valuable information is at risk of cyber attacks, which are mostly preceded by network reconnaissance. A moving target defense technique called host address mutation (HAM) helps facing network reconnaissance. However, there still exist several fundamental problems in HAM: 1) current approaches cannot be self-adaptive to adversarial strategies. 2) network state is time-varying because each host decides whether to mutate IP address. 3) most methods mainly focus on enhancing security, but ignore the survivability of existing connections. In this paper, an Intelligence-Driven Host Address Mutation (ID-HAM) scheme is proposed to address aforementioned challenges. We firstly model a Markov decision process (MDP) to describe the mutation process, and design a seamless mutation mechanism. Secondly, to remove infeasible actions from the action space of MDP, we formulate address-to-host assignments as a constrained satisfaction problem. Thirdly, we design an advantage actor-critic algorithm for HAM, which aims to learn from scanning behaviors. Finally, security analysis and extensive simulations highlight the effectiveness of ID-HAM. Compared with state-of-the-art solutions, ID-HAM can decrease maximum 25% times of scanning hits while only influencing communication slightly. We also implemented a proof-of-concept prototype system to conduct experiments with multiple scanning tools.

15 July 2020 in IEEE Communications Magazine
Verified
Journal Article
Closed access
ZZZan Zhou
Zan Zhou
XKXiaohui Kuang
Xiaohui Kuang
LSLimin Sun
Limin Sun
LZLujie Zhong
Lujie Zhong
CXChangqiao Xu
Changqiao Xu
Existing static defenses for online service systems can be fragile and costly due to the continuity of ubiquitous cyber attacks. LAD has become a promising technology to tackle this problem. However, the security of the defense mechanism itself is often neglected as LAD mainly focuses on fortifying the protected target. This would allow a new deductive attack to encroach on LADs by inferring and undermining defense strategy, and then the whole defense mechanism can be completely invalidated once for all. Such a problem leads to the urgent need to develop new defense technologies with self-protection capability. In this article, we propose a new endogenous security defense mechanism named LSSM. To the best of our knowledge, this is the first work to provide a systematic defense structure with endogenous security to resist deductive attacks. We first review the existing learning-enhanced active defense mechanisms and compare their pros and cons. Then the methodology of LSSM is illustrated targeting two major threats posed by deductive attacks. Experimental results highlight the performance of our method. Finally, we conclude this article with a discussion of several future directions for LADs.

20 February 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Xianmin WangXianmin Wang
Xianmin Wang
XKXiaohui Kuang
Xiaohui Kuang
Jing LiJing Li
Jing Li
XCXiaofeng Chen
Xiaofeng Chen
Zheli LiuZheli Liu
Zheli Liu
In the feature matching of some Vehicular Ad Hoc Network (VANET) technologies, users' privacy disclosure issue has seriously threatened personal safety and caused considerable economic loss. In this paper, we proposed Oblivious Transfer (OT) protocol and Private Set Intersection (PSI) protocol to protect the users' privacy in the situation of VANET's feature matching. In our schema, an efficient k-out-of-n OT protocol is constructed. Then, this OT protocol is adopted to give a PSI protocol with equality test. Based on the PSI protocol, the two parties of VANET can obtain the intersection of their characteristic sets and any information outside such intersection is unavailable. Accordingly, internal attacker fails to get any useful information from the two parties in the feature matching, and the two parties cannot obtain extra data of each other. Moreover, to reduce the computational cost of the OT protocol, the non-communicative algebraic structure-group ring Zq[Sm] is employed. In addition, we analyzed that the proposed scheme does not use complex calculations and can resist against the current quantum attacks.

1 December 2019
Verified
Conference Paper
Closed access
TZTao Zhang
Tao Zhang
XKXiaohui Kuang
Xiaohui Kuang
ZZZan Zhou
Zan Zhou
HGHongquan Gao
Hongquan Gao
CXChangqiao Xu
Changqiao Xu
Static network defense technologies are always in a passive defense state because of their disadvantages in cost, time and information. So Network Moving Target Defense (NMTD) is proposed as a kind of proactive defense technology. As an important research direction of NMTD, route mutation techniques still have limitations that they can not learn attack strategies and be adaptive in dynamical security situation. In this paper, we propose a novel route mutation mechanism based on reinforcement learning. We firstly investigate four different attack strategies and introduce a mixed attack strategy with entropy constraints. Then we formulate the network requirements using Satisfiability Module Theory (SMT) logic to acquire the route mutation space. We further propose a security-awareness Q- learning algorithm to select routes from the mutation space iteratively and conduct security awareness to adjust learning rate adaptively. Meanwhile, the optimal convergence of our algorithm is proved theoretically. Finally, experimental results highlight the effectiveness as defense performance, network overhead and convergence speed of our method compared to the representative solution.