Qian Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Qian Chen has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Xiaodong Lin
University of Guelph
10 shared publications - Zilong Wang
Xidian University
9 shared publications - Haonan Yan
School of Cyber Engineering, Xidian University, Xian, China
8 shared publications - Jianying Zhou
Singapore University of Technology and Design (SUTD)
5 shared publications - Tao Hu
Information Engineering University, Zhengzhou, China
4 shared publications - Hui Li
Xidian University, Xi'an, China
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5373-5387
SymSan: Mitigating Malware Embedding in Large Language Models via Parameter Space Symmetry
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5373-5387
Open AccessSymSan: Mitigating Malware Embedding in Large Language Models via Parameter Space Symmetry
- 8 July 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 350
AGAM: A randomly initialized policy network for action mask fusion in reinforcement learning
- 8 July 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 350
AGAM: A randomly initialized policy network for action mask fusion in reinforcement learning
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (3) , 1313-1328
A Privacy-Preserving and Non-Interactive Outsourced Tree Evaluation Scheme via Trusted Execution Environments
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (3) , 1313-1328
A Privacy-Preserving and Non-Interactive Outsourced Tree Evaluation Scheme via Trusted Execution Environments
- 27 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 8717-8732
EvaFL: An Efficient Verifiable Privacy-Preserving Federated Learning Against Malicious Servers
Federated Learning (FL) preserves client data privacy by distributing model training but remains vulnerable to inference attacks (e.g., gradient inversion). Existing secure aggregation schemes mitigate basic privacy threats, but most of them are under the semi-honest server assumption. Malicious servers can corrupt the global model through forging aggregation results. Moreover, the high interaction rounds and communication complexity of the existing schemes still constrain their feasibility in large-scale distributed deployment scenarios. To tackle these challenges, we propose EvaFL, an efficient verifiable privacy-preserving federated learning against malicious servers, which reduces the communication overhead and privacy threats from malicious severs. We propose the system model of EvaFL and give the concrete protocol. We leverage the linear homomorphism property of Shamir secret sharing under discrete logarithm assumption to reuse the mask seed shares, which avoids the communication overhead caused by share distribution in multiple rounds of iterations. In addition, by integrating consistency checking into the unmasking step, we further reduce one round interaction. To resist malicious servers, we adopt linear homomorphic hash to realize the correctness verification of the aggregation results. Finally, we implement and evaluate our EvaFL based on MNIST and CIFAR10 datasets to show its feasibility for privacy training. The single round aggregation completion time of EvaFL is reduced by 69% compared to BBGLR (CCS 2020) and by 11% compared to Flamingo (S&P 2023).
- 27 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 8717-8732
EvaFL: An Efficient Verifiable Privacy-Preserving Federated Learning Against Malicious Servers
Federated Learning (FL) preserves client data privacy by distributing model training but remains vulnerable to inference attacks (e.g., gradient inversion). Existing secure aggregation schemes mitigate basic privacy threats, but most of them are under the semi-honest server assumption. Malicious servers can corrupt the global model through forging aggregation results. Moreover, the high interaction rounds and communication complexity of the existing schemes still constrain their feasibility in large-scale distributed deployment scenarios. To tackle these challenges, we propose EvaFL, an efficient verifiable privacy-preserving federated learning against malicious servers, which reduces the communication overhead and privacy threats from malicious severs. We propose the system model of EvaFL and give the concrete protocol. We leverage the linear homomorphism property of Shamir secret sharing under discrete logarithm assumption to reuse the mask seed shares, which avoids the communication overhead caused by share distribution in multiple rounds of iterations. In addition, by integrating consistency checking into the unmasking step, we further reduce one round interaction. To resist malicious servers, we adopt linear homomorphic hash to realize the correctness verification of the aggregation results. Finally, we implement and evaluate our EvaFL based on MNIST and CIFAR10 datasets to show its feasibility for privacy training. The single round aggregation completion time of EvaFL is reduced by 69% compared to BBGLR (CCS 2020) and by 11% compared to Flamingo (S&P 2023).
- 10 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (8) , 12670-12687
RankFL: Robustness and Privacy-Preserving Federated Learning Scheme Against Poisoning Attacks
Distinguishing between benign and poisoned gradients hidden behind cryptographic masks is a critical challenge in privacy-preserving federated learning (FL). Existing robust aggregation defenses suffer from two primary limitations: (1) susceptibility to manipulation, where adversaries induce deviations from standard protocols to bypass statistics-based defenses (e.g., mean or median), and (2) limited detection granularity, where the reliance on coarse statistics under encryption fails to identify subtle or coordinated poisoning behaviors. To address these issues, we propose RankFL, a poison-robust and privacy-preserving FL scheme that leverages order sorting over ciphertext gradients. RankFL utilizes an efficient Paillier-based two-party comparison protocol to construct a joint order tree, facilitating quartile-driven filtering of malicious updates without compromising individual gradient privacy. Furthermore, we introduce RankFL-Extend, which incorporates zero-knowledge proof-of-knowledge and bidirectional verification to secure the ranking process against active adversaries. We provide a rigorous theoretical analysis to establish the scheme's privacy, indistinguishability, and convergence guarantees. Extensive experiments across diverse datasets and attack scenarios demonstrate that the proposed scheme achieves a $3\%$ accuracy improvement over state-of-the-art defenses under poisoning attacks.
- 10 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (8) , 12670-12687
RankFL: Robustness and Privacy-Preserving Federated Learning Scheme Against Poisoning Attacks
Distinguishing between benign and poisoned gradients hidden behind cryptographic masks is a critical challenge in privacy-preserving federated learning (FL). Existing robust aggregation defenses suffer from two primary limitations: (1) susceptibility to manipulation, where adversaries induce deviations from standard protocols to bypass statistics-based defenses (e.g., mean or median), and (2) limited detection granularity, where the reliance on coarse statistics under encryption fails to identify subtle or coordinated poisoning behaviors. To address these issues, we propose RankFL, a poison-robust and privacy-preserving FL scheme that leverages order sorting over ciphertext gradients. RankFL utilizes an efficient Paillier-based two-party comparison protocol to construct a joint order tree, facilitating quartile-driven filtering of malicious updates without compromising individual gradient privacy. Furthermore, we introduce RankFL-Extend, which incorporates zero-knowledge proof-of-knowledge and bidirectional verification to secure the ranking process against active adversaries. We provide a rigorous theoretical analysis to establish the scheme's privacy, indistinguishability, and convergence guarantees. Extensive experiments across diverse datasets and attack scenarios demonstrate that the proposed scheme achieves a $3\%$ accuracy improvement over state-of-the-art defenses under poisoning attacks.
- 20 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 5779-5790
SA-FL: Secure Aggregation Scheme in Federated Learning Against Poisoning Attacks
Federated learning (FL) enables collaborative training while keeping raw data on client devices, providing basic-level privacy protection. To further resist privacy breach incurred by inference attacks, secure aggregation techniques have been developed to prevent any party from accessing individual gradients. However, these techniques also hinder anomaly detection, leaving FL systems vulnerable to poisoning attacks under strong privacy constraints. In this paper, we propose SA-FL, a secure aggregation framework that enables effective poisoning detection while preserving privacy. SA-FL introduces an order-preserving blinding mechanism in which client updates are masked using a structured set of random factors that remain algebraically separable under modular arithmetic. The server assess similarity across blinded gradients without revealing their contents. To securely extract aggregated results, SA-FL employs a dual-server architecture in which two non-colluding entities jointly perform decryption, ensuring that no single party can access individual gradients. We provide a comprehensive theoretical analysis proving 1) the correctness of Pearson correlation coefficient computation under blinding, 2) convergence under dual-server aggregation, and 3) indistinguishability under hybrid arguments ensuring semantic privacy. Extensive experiments demonstrate that SA-FL enhances poisoning detection accuracy by up to 3% compared to existing defenses, with a negligible overhead of a few milliseconds per round.
- 20 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 5779-5790
SA-FL: Secure Aggregation Scheme in Federated Learning Against Poisoning Attacks
Federated learning (FL) enables collaborative training while keeping raw data on client devices, providing basic-level privacy protection. To further resist privacy breach incurred by inference attacks, secure aggregation techniques have been developed to prevent any party from accessing individual gradients. However, these techniques also hinder anomaly detection, leaving FL systems vulnerable to poisoning attacks under strong privacy constraints. In this paper, we propose SA-FL, a secure aggregation framework that enables effective poisoning detection while preserving privacy. SA-FL introduces an order-preserving blinding mechanism in which client updates are masked using a structured set of random factors that remain algebraically separable under modular arithmetic. The server assess similarity across blinded gradients without revealing their contents. To securely extract aggregated results, SA-FL employs a dual-server architecture in which two non-colluding entities jointly perform decryption, ensuring that no single party can access individual gradients. We provide a comprehensive theoretical analysis proving 1) the correctness of Pearson correlation coefficient computation under blinding, 2) convergence under dual-server aggregation, and 3) indistinguishability under hybrid arguments ensuring semantic privacy. Extensive experiments demonstrate that SA-FL enhances poisoning detection accuracy by up to 3% compared to existing defenses, with a negligible overhead of a few milliseconds per round.
- 22 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 41904-41923
Efficient and Privacy-Preserving Network Intrusion Detection Based on Federated Learning in SDN-Enabled IIoT Network
Modern decentralized deep learning methods for network intrusion detection in Software-Defined Networking (SDN)-enabled Industrial Internet of Things (IIoT) environments encounter significant challenges, particularly for IIoT data heterogeneity and privacy leakage. To this end, we propose a novel framework for network intrusion detection, dubbed SFLNID, that improves Federated Learning (FL) to ensure both efficient training and privacy preservation in SDN-enabled IIoT. Specifically, we firstly design joint optimization mechanism for unbalanced and non-IID data, which introduces a Focal loss as the loss function, and leverages the Wasserstein distance between global and local models as the regularization term. In addition, we improve adaptive differential privacy with dynamic gradient clipping techniques, adjusting the clip-threshold based on Holt exponential smoothing to achieve privacy protection during the local model training. Moreover, we develop a customized CNN-GRU model tailored for FL-based network intrusion detection to make a tradeoff between model accuracy and overheads. Theoretical analysis confirms the convergence and privacy guarantees of SFLNID. Extensive experiments, conducted on well-known IIoT datasets including ToN-IoT, RT-IoT and Edge-IIoT, demonstrate that SFLNID outperforms the state-of-the-art methods in terms of detection accuracy, communication overhead, and cooperative privacy preservation.
- 22 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 41904-41923
Efficient and Privacy-Preserving Network Intrusion Detection Based on Federated Learning in SDN-Enabled IIoT Network
Modern decentralized deep learning methods for network intrusion detection in Software-Defined Networking (SDN)-enabled Industrial Internet of Things (IIoT) environments encounter significant challenges, particularly for IIoT data heterogeneity and privacy leakage. To this end, we propose a novel framework for network intrusion detection, dubbed SFLNID, that improves Federated Learning (FL) to ensure both efficient training and privacy preservation in SDN-enabled IIoT. Specifically, we firstly design joint optimization mechanism for unbalanced and non-IID data, which introduces a Focal loss as the loss function, and leverages the Wasserstein distance between global and local models as the regularization term. In addition, we improve adaptive differential privacy with dynamic gradient clipping techniques, adjusting the clip-threshold based on Holt exponential smoothing to achieve privacy protection during the local model training. Moreover, we develop a customized CNN-GRU model tailored for FL-based network intrusion detection to make a tradeoff between model accuracy and overheads. Theoretical analysis confirms the convergence and privacy guarantees of SFLNID. Extensive experiments, conducted on well-known IIoT datasets including ToN-IoT, RT-IoT and Edge-IIoT, demonstrate that SFLNID outperforms the state-of-the-art methods in terms of detection accuracy, communication overhead, and cooperative privacy preservation.
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 39088-39104
Medishuffle: Auditable Coin Mixing Scheme for Internet of Medical Things
The widespread adoption of the Internet of Medical Things (IoMT) has spurred the development of blockchain-based models for medical data sharing, designed to ensure both data trustworthiness and privacy protection. In these models, data owners upload medical data to the blockchain via anonymized transactions, enabling researchers to access and analyze the on-chain data. Existing approaches often utilize coin-mixing techniques to obscure the relationships between transacting parties on the blockchain, thereby enhancing privacy. However, such solutions face challenges related to inefficiency and limited data usability, making them unsuitable for deployment in blockchain-based medical scenarios. To address the issue, we propose Medishuffle, an auditable coin-mixing protocol tailored for IoMT applications. Medishuffle introduces a polynomial-based group signature algorithm to facilitate the shuffling process, leveraging identity anonymity instead of traditional data encryption to reduce computational overhead. Additionally, the traceability feature of group signatures enables auditors to reconstruct the sequence of obfuscated transactions when necessary. Through theoretical analysis, we demonstrate that Medishuffle ensures both the unforgeability and traceability of signatures under the random oracle model in the query process. Using experiments, we show that Medishuffle outperforms existing solutions by offering enhanced functionality without a significant increase in computational overhead, making it a practical and efficient solution for IoMT-based medical data sharing.
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 39088-39104
Medishuffle: Auditable Coin Mixing Scheme for Internet of Medical Things
The widespread adoption of the Internet of Medical Things (IoMT) has spurred the development of blockchain-based models for medical data sharing, designed to ensure both data trustworthiness and privacy protection. In these models, data owners upload medical data to the blockchain via anonymized transactions, enabling researchers to access and analyze the on-chain data. Existing approaches often utilize coin-mixing techniques to obscure the relationships between transacting parties on the blockchain, thereby enhancing privacy. However, such solutions face challenges related to inefficiency and limited data usability, making them unsuitable for deployment in blockchain-based medical scenarios. To address the issue, we propose Medishuffle, an auditable coin-mixing protocol tailored for IoMT applications. Medishuffle introduces a polynomial-based group signature algorithm to facilitate the shuffling process, leveraging identity anonymity instead of traditional data encryption to reduce computational overhead. Additionally, the traceability feature of group signatures enables auditors to reconstruct the sequence of obfuscated transactions when necessary. Through theoretical analysis, we demonstrate that Medishuffle ensures both the unforgeability and traceability of signatures under the random oracle model in the query process. Using experiments, we show that Medishuffle outperforms existing solutions by offering enhanced functionality without a significant increase in computational overhead, making it a practical and efficient solution for IoMT-based medical data sharing.
- 16 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 4999-5014
DP-DID: A Dynamic and Proactive Decentralized Identity System
Decentralized identity (DID) is a transformative paradigm that leverages blockchain, decentralized identifiers and verifiable credentials (VCs) to enable self-sovereign and decentralized identity management with myriad application areas. However, existing DID implementations are confronted with two key challenges: insufficient decentralization and vulnerability to mobile adversary attacks. First, they paradoxically introduce central identity resolvers, intermediaries or static committees to manage critical identity services, key management or credential issuance, which violates the decentralized controlling aim against a single point of failure. Second, these systems are vulnerable to mobile adversaries who can gradually compromise multiple nodes or committee members over a long period, eventually seizing control of the system. In this paper, we propose DP-DID, the first dynamic and proactive decentralized identity system specifically designed to resist mobile adversary attacks in dynamic committee settings. To eliminate centralized authorities, DP-DID leverages blockchain, dynamic committees and BLS1 signatures, which achieves decentralization. In addition, we design a dynamic and batch proactive secret sharing (DBPSS) scheme for DP-DID to ensure proactive security against mobile adversary attacks. This is achieved by allowing at most t (threshold) committees to be corrupted per period, with the set of corrupted committees changing dynamically even if all players are eventually compromised. By incorporating DBPSS, DP-DID achieves efficient key management for multiple users in dynamic settings, enhancing overall system scalability. Through rigorous analysis, DP-DID is proven to be forward secure and secure against mobile adversary attacks under a widely adopted malicious model. Extensive experiments show that DP-DID has efficient performance, and our DBPSS scheme outperforms FaB-DPSS by over 11.67× in key handover efficiency.
- 16 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 4999-5014
DP-DID: A Dynamic and Proactive Decentralized Identity System
Decentralized identity (DID) is a transformative paradigm that leverages blockchain, decentralized identifiers and verifiable credentials (VCs) to enable self-sovereign and decentralized identity management with myriad application areas. However, existing DID implementations are confronted with two key challenges: insufficient decentralization and vulnerability to mobile adversary attacks. First, they paradoxically introduce central identity resolvers, intermediaries or static committees to manage critical identity services, key management or credential issuance, which violates the decentralized controlling aim against a single point of failure. Second, these systems are vulnerable to mobile adversaries who can gradually compromise multiple nodes or committee members over a long period, eventually seizing control of the system. In this paper, we propose DP-DID, the first dynamic and proactive decentralized identity system specifically designed to resist mobile adversary attacks in dynamic committee settings. To eliminate centralized authorities, DP-DID leverages blockchain, dynamic committees and BLS1 signatures, which achieves decentralization. In addition, we design a dynamic and batch proactive secret sharing (DBPSS) scheme for DP-DID to ensure proactive security against mobile adversary attacks. This is achieved by allowing at most t (threshold) committees to be corrupted per period, with the set of corrupted committees changing dynamically even if all players are eventually compromised. By incorporating DBPSS, DP-DID achieves efficient key management for multiple users in dynamic settings, enhancing overall system scalability. Through rigorous analysis, DP-DID is proven to be forward secure and secure against mobile adversary attacks under a widely adopted malicious model. Extensive experiments show that DP-DID has efficient performance, and our DBPSS scheme outperforms FaB-DPSS by over 11.67× in key handover efficiency.