Yueqin Li

Dr. Yueqin Li


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
24 March 2022 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
WZWei Zhang
Wei Zhang
YLYueqin Li
Yueqin Li
XLXiaofeng Li
Xiaofeng Li
MSMinggang Shao
Minggang Shao
YMYajie Mi
Yajie Mi
ZGZhi Guoqing
Zhi Guoqing
Among the network security problems, SQL injection is a common and challenging network attack means, which can cause inestimable loop-breaking and loss to the database, and how to detect SQL injection statements is one of the current research hotspots. Based on the data characteristics of SQL statements, a deep neural network-based SQL injection detection model and algorithm are built. The core method is to convert the data into word vector form by word pause method, then form a sparse matrix and pass it into the model for training, build a multihidden layer deep neural network model containing ReLU function, optimize the traditional loss function, and introduce Dropout method to improve the generalization ability of this model. The accuracy of the final model is maintained at over 96%. By comparing the experimental results with traditional machine learning algorithms and LSTM algorithms, the proposed algorithm effectively solves the problems of overfitting in machine learning and the need for manual screening to extract features, which greatly improves the accuracy of SQL injection detection.

1 January 2024 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
QQQiurong Qin
Qiurong Qin
YLYueqin Li
Yueqin Li
YMYajie Mi
Yajie Mi
JSJinhui Shen
Jinhui Shen
KWKexin Wu
Kexin Wu
ZWZhenzhao Wang
Zhenzhao Wang
In the era of the Internet, widely used web applications have become the target of hacker attacks because they contain a large amount of personal information. Among these vulnerabilities, stealing private data through cross-site scripting (XSS) attacks is one of the most commonly used attacks by hackers. Currently, deep learning-based XSS attack detection methods have good application prospects; however, they suffer from problems such as being prone to overfitting, a high false alarm rate, and low accuracy. To address these issues, we propose a multi-stage feature extraction and fusion model for XSS detection based on Random Forest feature enhancement. The model utilizes Random Forests to capture the intrinsic structure and patterns of the data by extracting leaf node indices as features, which are subsequently merged with the original data features to form a feature set with richer information content. Further feature extraction is conducted through three parallel channels. Channel I utilizes parallel one-dimensional convolutional layers (1D convolutional layers) with different convolutional kernel sizes to extract local features at different scales and perform multi-scale feature fusion; Channel II employs maximum one-dimensional pooling layers (max 1D pooling layers) of various sizes to extract key features from the data; and Channel III extracts global information bi-directionally using a Bi-Directional Long-Short Term Memory Network (Bi-LSTM) and incorporates a multi-head attention mechanism to enhance global features. Finally, effective classification and prediction of XSS are performed by fusing the features of the three channels. To test the effectiveness of the model, we conduct experiments on six datasets. We achieve an accuracy of 100% on the UNSW-NB15 dataset and 99.99% on the CICIDS2017 dataset, which is higher than that of the existing models.

12 March 2025 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
QQQiurong Qin
Qiurong Qin
YLYueqin Li
Yueqin Li
YMYajie Mi
Yajie Mi
JSJinhui Shen
Jinhui Shen
KWKexin Wu
Kexin Wu
ZWZhenzhao Wang
Zhenzhao Wang


1 January 2026 in Computers, Materials & Continua
Verified
Journal Article
Closed access
PDF file
CWChen Wang
Chen Wang
YLYueqin Li
Yueqin Li
HLHai Li
Hai Li
GSGuoxuan Sun
Guoxuan Sun
XLXiaofeng Li
Xiaofeng Li
CTChongle Tian
Chongle Tian
Penetration testing is an important security assessment technique for proactively discovering and validating security vulnerabilities. However, conventional penetration testing relies heavily on human expertise, making consistent and repeatable execution at scale difficult to achieve. Large language models (LLMs) offer a new approach to automating penetration testing, yet existing methods still face several challenges in multi-stage tasks, including task-state loss, success judgments unsupported by concrete evidence, and repeated attempts along ineffective execution paths. To address these issues, we propose HTN-PT, an automated web penetration testing framework that integrates LLMs with a Hierarchical Task Network (HTN). HTN-PT explicitly organizes task decomposition, preconditions, and execution dependencies, while structured runtime memory preserves facts across stages. This design prevents long-horizon task state from depending on the LLM’s transient conversational context. Within this framework, the LLM is responsible only for vulnerability interpretation, action generation, and feedback analysis for the current task. Execution outcomes are independently verified using external evidence, while failure feedback is used either to repair the current execution path or to switch to another vulnerability candidate, thereby improving continuity and recoverability across multi-stage execution. We conduct 1600 experiments on 20 authorized web testbeds using four foundation models and four task-control methods. HTN-PT achieves overall Pass@1 and Pass@5 scores of 43.25% and 67.5%, respectively. Testbed-level paired cluster-bootstrap intervals for its differences from the three baselines remain above zero for both metrics. The results show that HTN-PT improves task-state continuity, outcome verification, and failure recovery for LLMs in multi-stage penetration testing, thereby enhancing end-to-end task completion.