Lihai Nie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lihai Nie has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Laiping Zhao
Tianjin University
6 shared publications - Zheli Liu
College of Cryptology and Cyber Science, DISSec, Nankai University, Tianjin, China
5 shared publications - Keqiu Li
Tianjin University
3 shared publications - Tong Li
College of Cryptology and Cyber Science, DISSec, Nankai University, Tianjin, China
3 shared publications - Xiaodong Dong
College of Cyber Science and the College of Computer Science, Key Laboratory of Data and Intelligent System Security, Ministry of Education, Nankai University, Tianjin, China
3 shared publications - Baolei Zhang
Nankai University
1 shared publication
Latest Publications
- Open Access
- 8 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 33-44
Practical Poisoning Attacks against Retrieval-Augmented Generation
- 8 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 33-44
Open AccessPractical Poisoning Attacks against Retrieval-Augmented Generation
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2547-2556
SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2547-2556
Open AccessSIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 560-577
Stinger: A Light-Weight Website Fingerprinting Defense Through Poisoning Packet Sequences
Website Fingerprinting (WF) attack can be mitigated through random camouflage or pair camouflage. Random camouflage inserts random dummy packets into the traces according to pre-defined rules. It can be compromised easily by machine learning-based WF attacks. Pair camouflage obfuscates the distinguishing features of paired websites by inserting elaborated perturbations into raw traces, thereby misleading the attacker. It is costly in maintaining a perturbation generator for each pair of websites. Based on these insights, we propose Stinger, a novel data poisoning based WF defense, which enables effective defense against WF attacks with low bandwidth overhead and only maintains one generator for all websites. Stinger exploits the idea of poisoning by contaminating the model directly in such a way that the WF attacks only classify based on the inserted poison sequences, thus being low overhead and website independent. We experimentally evaluate Stinger using the DF and AWF datasets. The results show that Stinger improves the successful defending rate by an average of 20.37% and 22.83% while reducing overhead by 85.88% and 81.35%, respectively.
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 560-577
Stinger: A Light-Weight Website Fingerprinting Defense Through Poisoning Packet Sequences
Website Fingerprinting (WF) attack can be mitigated through random camouflage or pair camouflage. Random camouflage inserts random dummy packets into the traces according to pre-defined rules. It can be compromised easily by machine learning-based WF attacks. Pair camouflage obfuscates the distinguishing features of paired websites by inserting elaborated perturbations into raw traces, thereby misleading the attacker. It is costly in maintaining a perturbation generator for each pair of websites. Based on these insights, we propose Stinger, a novel data poisoning based WF defense, which enables effective defense against WF attacks with low bandwidth overhead and only maintains one generator for all websites. Stinger exploits the idea of poisoning by contaminating the model directly in such a way that the WF attacks only classify based on the inserted poison sequences, thus being low overhead and website independent. We experimentally evaluate Stinger using the DF and AWF datasets. The results show that Stinger improves the successful defending rate by an average of 20.37% and 22.83% while reducing overhead by 85.88% and 81.35%, respectively.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 802-816
Viper: Priority-Based High-Visibility Per-Flow Packet Sampling for SDNs
Packet sampling is crucial for managing datacenter networks, serving fault diagnosis, traffic measurement, and intrusion detection functions. However, traditional sampling techniques, such as those based on sketches or ports, either lack packet-level granularity or provide insufficient visibility, leading to functional performance degradation. Recent research has employed the software-defined networking (SDN) model to enable flow-based packet sampling. However, these approaches often introduce substantial control and computation overhead, limiting their scalability. This paper presents Viper, a novel priority-based, high-visibility per-flow packet sampling mechanism tailored to address these challenges. Specifically, Viper leverages existing priority-based traffic scheduling mechanisms to prioritize shorter flows over longer ones. Then, a logical centralized controller orchestrates sampling policies for packets of different priorities. In-depth analysis indicates that the orchestration performed by the controller significantly impacts Viper’s performance. Consequently, we model this process as a nonlinear optimization problem, seeking to maximize the utility of sampling. Then, we propose an online primal-dual interior-point algorithm to address this optimization problem and prove the algorithm’s convergence, optimality, and efficiency. Experimental results show that Viper increases visibility by 3.83% to 8.3%, with negligible control overhead and a substantial reduction in sampling load by at least 20.51%.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 802-816
Viper: Priority-Based High-Visibility Per-Flow Packet Sampling for SDNs
Packet sampling is crucial for managing datacenter networks, serving fault diagnosis, traffic measurement, and intrusion detection functions. However, traditional sampling techniques, such as those based on sketches or ports, either lack packet-level granularity or provide insufficient visibility, leading to functional performance degradation. Recent research has employed the software-defined networking (SDN) model to enable flow-based packet sampling. However, these approaches often introduce substantial control and computation overhead, limiting their scalability. This paper presents Viper, a novel priority-based, high-visibility per-flow packet sampling mechanism tailored to address these challenges. Specifically, Viper leverages existing priority-based traffic scheduling mechanisms to prioritize shorter flows over longer ones. Then, a logical centralized controller orchestrates sampling policies for packets of different priorities. In-depth analysis indicates that the orchestration performed by the controller significantly impacts Viper’s performance. Consequently, we model this process as a nonlinear optimization problem, seeking to maximize the utility of sampling. Then, we propose an online primal-dual interior-point algorithm to address this optimization problem and prove the algorithm’s convergence, optimality, and efficiency. Experimental results show that Viper increases visibility by 3.83% to 8.3%, with negligible control overhead and a substantial reduction in sampling load by at least 20.51%.
- 28 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (2) , 197-211
Slark: A Performance Robust Decentralized Inter-Datacenter Deadline-Aware Coflows Scheduling Framework With Local Information
Inter-datacenter network applications generate massive coflows for purposes, e.g., backup, synchronization, and analytics, with deadline requirements. Decentralized coflow scheduling frameworks are desirable for their scalability in cross-domain deployment but grappling with the challenge of information agnosticism for lack of cross-domain privileges. Current information-agnostic coflow scheduling methods are incompatible with decentralized frameworks for relying on centralized controllers to continuously monitor and learn from coflow global transmission states to infer global coflow information. Alternative methods propose mechanisms for decentralized global coflow information gathering and synchronization. However, they require dedicated physical hardware or control logic, which could be impractical for incremental deployment. This paper proposes Slark, a decentralized deadline-aware coflow scheduling framework, which meets coflows' soft and hard deadline requirements using only local traffic information. It eschews requiring global coflow transmission states and dedicated hardware or control logic by leveraging multiple software-implemented scheduling agents working independently on each node and integrating such information agnosticism into node-specific bandwidth allocation by modeling it as a robust optimization problem with flow information on the other nodes represented as uncertain parameters. Subsequently, we validate the performance robustness of Slark by investigating how perturbations in the optimal objective function value and the associated optimal solution are affected by uncertain parameters. Finally, we propose a firebug-swarm-optimization-based heuristic algorithm to tackle the non-convexity in our problem. Experimental results demonstrate that Slark can significantly enhance transmission revenue and increase soft and hard deadline guarantee ratios by 10.52% and 7.99% on average.
- 28 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (2) , 197-211
Slark: A Performance Robust Decentralized Inter-Datacenter Deadline-Aware Coflows Scheduling Framework With Local Information
Inter-datacenter network applications generate massive coflows for purposes, e.g., backup, synchronization, and analytics, with deadline requirements. Decentralized coflow scheduling frameworks are desirable for their scalability in cross-domain deployment but grappling with the challenge of information agnosticism for lack of cross-domain privileges. Current information-agnostic coflow scheduling methods are incompatible with decentralized frameworks for relying on centralized controllers to continuously monitor and learn from coflow global transmission states to infer global coflow information. Alternative methods propose mechanisms for decentralized global coflow information gathering and synchronization. However, they require dedicated physical hardware or control logic, which could be impractical for incremental deployment. This paper proposes Slark, a decentralized deadline-aware coflow scheduling framework, which meets coflows' soft and hard deadline requirements using only local traffic information. It eschews requiring global coflow transmission states and dedicated hardware or control logic by leveraging multiple software-implemented scheduling agents working independently on each node and integrating such information agnosticism into node-specific bandwidth allocation by modeling it as a robust optimization problem with flow information on the other nodes represented as uncertain parameters. Subsequently, we validate the performance robustness of Slark by investigating how perturbations in the optimal objective function value and the associated optimal solution are affected by uncertain parameters. Finally, we propose a firebug-swarm-optimization-based heuristic algorithm to tackle the non-convexity in our problem. Experimental results demonstrate that Slark can significantly enhance transmission revenue and increase soft and hard deadline guarantee ratios by 10.52% and 7.99% on average.
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (1) , 779-792
A Game-Based Adversarial DGA Detection Scheme Using Multi-Level Incremental Random Forest
Security vendors can take down botnets by detecting the malicious domain names crafted by attackers. However, the adversarial Domain Generation Algorithms ( DGAs ) greatly challenge the existing domain detection schemes, in particular, adversarial DGAs can actively compromise arbitrarily specified domain detection systems by crafting the adversarial domain names. To resist adversarial DGAs, we propose a game theory-based defending strategy, which launches adversarial DGA and trains an incremental domain detector alternately. While we find the game-based strategy cannot achieve the expected detection accuracy due to two problems: the failure of incremental training and the problem of the catastrophic forgetting . To this end, we propose a multi-level incremental random forest model, which settles the above problems by splitting the leaf nodes of the decision trees and increasing the levels of the original random forest. The experimental results on the real-life dataset demonstrate the proposed detection method significantly outperforms the competing schemes when detecting adversarial DGAs (improves the detection AUC by 42%) and presents comparable performance when defending against non-adversarial DGAs.
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (1) , 779-792
A Game-Based Adversarial DGA Detection Scheme Using Multi-Level Incremental Random Forest
Security vendors can take down botnets by detecting the malicious domain names crafted by attackers. However, the adversarial Domain Generation Algorithms ( DGAs ) greatly challenge the existing domain detection schemes, in particular, adversarial DGAs can actively compromise arbitrarily specified domain detection systems by crafting the adversarial domain names. To resist adversarial DGAs, we propose a game theory-based defending strategy, which launches adversarial DGA and trains an incremental domain detector alternately. While we find the game-based strategy cannot achieve the expected detection accuracy due to two problems: the failure of incremental training and the problem of the catastrophic forgetting . To this end, we propose a multi-level incremental random forest model, which settles the above problems by splitting the leaf nodes of the decision trees and increasing the levels of the original random forest. The experimental results on the real-life dataset demonstrate the proposed detection method significantly outperforms the competing schemes when detecting adversarial DGAs (improves the detection AUC by 42%) and presents comparable performance when defending against non-adversarial DGAs.
- 24 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 4854-4869
PKDGA: A Partial Knowledge-Based Domain Generation Algorithm for Botnets
Domain generation algorithms (DGAs) can be categorized into three types: zero-knowledge , partial-knowledge , and full-knowledge . While prior research merely focused on zero-knowledge and full-knowledge types, we characterize their anti-detection ability and practicality and find that zero-knowledge DGAs present low anti-detection ability against detectors , and full-knowledge DGAs suffer from low practicality due to the strong assumption that they are fully detector -aware. Given these observations, we propose PKDGA , a partial knowledge-based domain generation algorithm with high anti-detection ability and high practicality. PKDGA employs the reinforcement learning architecture, which makes it evolve automatically based only on the easily-observable feedback from detectors. We evaluate PKDGA using a comprehensive set of real-world datasets, and the results demonstrate that it reduces the detection performance of existing detectors from 91.7% to 52.5%. We further apply PKDGA to the Mirai malware, and the evaluations show that the proposed method is quite lightweight and time-efficient.
- 24 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 4854-4869
PKDGA: A Partial Knowledge-Based Domain Generation Algorithm for Botnets
Domain generation algorithms (DGAs) can be categorized into three types: zero-knowledge , partial-knowledge , and full-knowledge . While prior research merely focused on zero-knowledge and full-knowledge types, we characterize their anti-detection ability and practicality and find that zero-knowledge DGAs present low anti-detection ability against detectors , and full-knowledge DGAs suffer from low practicality due to the strong assumption that they are fully detector -aware. Given these observations, we propose PKDGA , a partial knowledge-based domain generation algorithm with high anti-detection ability and high practicality. PKDGA employs the reinforcement learning architecture, which makes it evolve automatically based only on the easily-observable feedback from detectors. We evaluate PKDGA using a comprehensive set of real-world datasets, and the results demonstrate that it reduces the detection performance of existing detectors from 91.7% to 52.5%. We further apply PKDGA to the Mirai malware, and the evaluations show that the proposed method is quite lightweight and time-efficient.
- 2 March 2023
- Published by Springer Nature in World Wide Web
- Vol. 26 (5) , 2329-2349
Robust website fingerprinting through resource loading sequence
- 2 March 2023
- Published by Springer Nature in World Wide Web
- Vol. 26 (5) , 2329-2349
Robust website fingerprinting through resource loading sequence
- Open Access
- 17 June 2022
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2022, 1-9
Optimization of the Economic and Trade Management Legal Model Based on the Support Vector Machine Algorithm and Logistic Regression Algorithm
Nowadays, various algorithms are widely used in the field of economy and trade, and economic and trade management laws also need to introduce scientific and effective data models for optimization. In this paper, support vector machine algorithm and logistic regression algorithm are used to analyze and process the actual economic and trade case data and bank loan user data, and a hybrid model of support vector machine and logistic regression is established. This study first introduces the basic definitions and contents of the support vector machine algorithm and logistic regression algorithm, and then constructs a hybrid model by randomly dividing the data, first using the support vector machine algorithm to calculate the results, and then inputting them into the logistic regression algorithm. The first mock exam is that the efficiency of the hybrid model is much higher than that of the single model. This study mainly optimizes and upgrades the legal system of economic and trade management from two aspects. In the prediction of economic and trade legal cases, the hybrid model is significantly better than FastText and LSTM models in accuracy and macro recall performance. In terms of credit risk prediction of economic and trade loan users, the subset most likely to default in the loan customer set is obtained.
- 17 June 2022
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2022, 1-9
Open AccessOptimization of the Economic and Trade Management Legal Model Based on the Support Vector Machine Algorithm and Logistic Regression Algorithm
Nowadays, various algorithms are widely used in the field of economy and trade, and economic and trade management laws also need to introduce scientific and effective data models for optimization. In this paper, support vector machine algorithm and logistic regression algorithm are used to analyze and process the actual economic and trade case data and bank loan user data, and a hybrid model of support vector machine and logistic regression is established. This study first introduces the basic definitions and contents of the support vector machine algorithm and logistic regression algorithm, and then constructs a hybrid model by randomly dividing the data, first using the support vector machine algorithm to calculate the results, and then inputting them into the logistic regression algorithm. The first mock exam is that the efficiency of the hybrid model is much higher than that of the single model. This study mainly optimizes and upgrades the legal system of economic and trade management from two aspects. In the prediction of economic and trade legal cases, the hybrid model is significantly better than FastText and LSTM models in accuracy and macro recall performance. In terms of credit risk prediction of economic and trade loan users, the subset most likely to default in the loan customer set is obtained.