Hongyu Yang

Mr. Hongyu Yang


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
25 April 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
LYLihua Yin
Lihua Yin
WCWeizhe Chen
Weizhe Chen
XLXi Luo
Xi Luo
HYHongyu Yang
Hongyu Yang
In recent years, with the rapid development of the Internet of Things, large-scale botnet attacks have occurred frequently and have become an important challenge to network security. As artificial intelligence technology continues to evolve, intelligent detection solutions for botnets are constantly emerging. Although graph neural networks are widely used for botnet detection, directly handling large-scale botnet data becomes inefficient and challenging as the number of infected hosts increases and the network scale expands. Especially in the process of node level learning and inference, a large number of nodes and edges need to be processed, leading to a significant increase in computational complexity and posing new challenges to network security. This paper presents a novel approach that can accurately identify diverse intricate botnet architectures in extensive IoT networks based on the aforementioned circumstance. By utilizing GraphSAINT to process large-scale IoT botnet graph data, efficient and unbiased subgraph sampling has been achieved. In addition, a solution with enhanced information representation capability has been developed based on the Graph Isomorphism Network (GIN) for botnet detection. Compared with the five currently popular graph neural network (GNN) models, our approach has been tested on C2, P2P, and Chord datasets, and higher accuracy has been achieved.

17 February 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
KQKexiang Qian
Kexiang Qian
HYHongyu Yang
Hongyu Yang
RLRuyu Li
Ruyu Li
WCWeizhe Chen
Weizhe Chen
XLXi Luo
Xi Luo
LYLihua Yin
Lihua Yin
With the rapid growth of IoT devices, the threat of botnets is becoming increasingly worrying. There are more and more intelligent detection solutions for botnets that have been proposed with the development of artificial intelligence. However, due to the current lack of computing power in IoT devices, these intelligent methods often cannot be well-applied to IoT devices. Based on the above situation, this paper proposes a distributed botnet detection method based on graph partitioning, efficiently detecting botnets using graph convolutional networks. In order to alleviate the wide range of IoT environments and the limited computing power of IoT devices, the algorithm named METIS is used to divide the network traffic structure graph into small graphs. To ensure robust information flow between nodes while preventing gradient explosion, diagonal enhancement is applied to refine the embedding representations at each layer, facilitating accurate botnet attack detection. Through comparative analysis with GATv2, GraphSAGE, and GCN across the C2, P2P, and Chord datasets, our method demonstrates superior performance in both accuracy and F1 score metrics. Moreover, an exploration into the effects of varying cluster numbers and depths revealed that six cluster levels yielded optimal results on the C2 dataset. This research significantly contributes to mitigating the IoT botnet threat, offering a scalable and effective solution for diverse IoT ecosystems.

8 July 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
XLXi Luo
Xi Luo
HFHonghui Fan
Honghui Fan
LYLihua Yin
Lihua Yin
SJShijie Jia
Shijie Jia
KZKaiyan Zhao
Kaiyan Zhao
HYHongyu Yang
Hongyu Yang
With the rise of generative artificial intelligence, malware creation has become more accessible, leading to a surge in malware and its variants. Traditional detection methods struggle to keep pace with this evolution. Dynamic analysis, though detailed, is resource intensive and susceptible to variations in computer hardware and simulation environments. Static analysis, on the other hand, faces the challenge of discerning valuable features from an extensive pool, especially for software across diverse architectures. To tackle these issues, we propose a binary sample classification approach based on raw bytes, named CAG-Malconv, which incorporates Convolutional Block Attention Module (CBAM) and Bidirectional Gated Recurrent Unit (BiGRU) to extract byte-level features. We evaluated it on two datasets with 48,000 samples of different file types and families. It outperforms state-of-the-art methods based on advanced features and raw bytes in terms of accuracy (ACC), Area Under the Curve (AUC), F1 score, and recall. Furthermore, it allows for the visualization of raw samples, facilitating the precise identification of malicious components like C&C URLs and encryption loops by analyzing activation patterns in hidden layers, thus streamlining malware investigative procedures.

1 January 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
XLXi Luo
Xi Luo
LYLihua Yin
Lihua Yin
HYHongyu Yang
Hongyu Yang
ZLZeyan Liu
Zeyan Liu
WCWeizhe Chen
Weizhe Chen
HXHongli Xiang
Hongli Xiang

1 January 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
DZDexin Zhu
Dexin Zhu
HCHongyuan Cheng
Hongyuan Cheng
LYLihua Yin
Lihua Yin
WCWeizhe Chen
Weizhe Chen
HYHongyu Yang
Hongyu Yang
YTYujin Tian
Yujin Tian

13 May 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
YCYixin Chen
Yixin Chen
WCWeizhe Chen
Weizhe Chen
LYLihua Yin
Lihua Yin
NWNan Wei
Nan Wei
HYHongyu Yang
Hongyu Yang
JWJiaxin Wu
Jiaxin Wu
Domain Generation Algorithm(DGA) is widely used by botnets to evade detection by generating numerous pseudo-random domains to communicate with commandandcontrol servers. While existing Graph Neural Networks attempt to detect DGA botnets by exploiting the feature similarity of these domains to model semantic associations via similarity graphs, they are restricted to binary relationships, causing information decay during multi-hop propagation. To overcome this, we propose HyperDGA. Treating domains as nodes, HyperDGA utilizes K Nearest Neighbors to construct hyperedges, explicitly capturing high order group semantic correlations. Subsequently, a Local Topology Aggregation module employs multi-head node attention-based hypergraph convolution to dynamically assign distinct aggregation weights to intra hyperedge nodes, extracting fine-grained structural features. To mitigate the limited receptive field of hypergraph convolutions, a Global Node Association module integrates the selective state space model, Mamba, to capture long-range dependencies across all nodes. Experiments on two public datasets demonstrate that HyperDGA outperforms all baselines and achieves over 99% accuracy, validating the efficacy of high-order semantic modeling for DGA botnet detection.