Qipeng Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Qipeng Xie has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Kaishun Wu
The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China
8 shared publications - Weizheng Wang
Guangzhou University
5 shared publications - Yongzhi Huang
The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China
4 shared publications - Linshan Jiang
National University of Singapore, Singapore, Singapore
3 shared publications - Lu Wang
Shenzhen University
3 shared publications - Chunhua Su
The University of Aizu
2 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (10) , 15798-15817
PIT+: A Smart Toothbrush With View-Adaptive Plaque Visualization
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (10) , 15798-15817
PIT+: A Smart Toothbrush With View-Adaptive Plaque Visualization
- 5 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-15
A Lightweight Chaotic Map-Based Authentication Scheme for Secure Wearable Computing
Wearable computing enables continuous sensing and cloud analytics, but sensitive physiological data remain vulnerable to eavesdropping, tampering, hijacking, and traceability across wireless and cloud links. Because wearable devices have tight battery, computation, memory, and bandwidth limits, heavyweight authentication is impractical. Existing schemes either rely on costly operations, incur multiple communication rounds, or remain vulnerable to de-synchronization and ephemeral-secret-leakage attacks in multi-party settings. To address these issues, we present a lightweight chaotic map-based authentication and key-exchange scheme for cloud-assisted wearable computing. The scheme combines Chebyshev polynomials, hash functions, and lightweight symmetric protection to realize mutual authentication among wearable devices, mobile terminals, and cloud servers while establishing secure session keys and supporting dynamic pseudonym renewal. Informal analysis shows resistance to replay, de-synchronization, man-in-the-middle, password-guessing, traceability, and ephemeral-secret-leakage attacks while preserving anonymity and forward secrecy. Formal analysis in the Real-Or-Random model proves session-key indistinguishability against classical polynomial-time adversaries under the CMDLP/CMCDHP assumptions. Compared with a recent ASCON-based three-party baseline, the scheme reduces total computation and communication costs by 28.8% and 28.7%, respectively. These results show a practical security-efficiency balance for resource-constrained healthcare wearables.
- 5 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-15
A Lightweight Chaotic Map-Based Authentication Scheme for Secure Wearable Computing
Wearable computing enables continuous sensing and cloud analytics, but sensitive physiological data remain vulnerable to eavesdropping, tampering, hijacking, and traceability across wireless and cloud links. Because wearable devices have tight battery, computation, memory, and bandwidth limits, heavyweight authentication is impractical. Existing schemes either rely on costly operations, incur multiple communication rounds, or remain vulnerable to de-synchronization and ephemeral-secret-leakage attacks in multi-party settings. To address these issues, we present a lightweight chaotic map-based authentication and key-exchange scheme for cloud-assisted wearable computing. The scheme combines Chebyshev polynomials, hash functions, and lightweight symmetric protection to realize mutual authentication among wearable devices, mobile terminals, and cloud servers while establishing secure session keys and supporting dynamic pseudonym renewal. Informal analysis shows resistance to replay, de-synchronization, man-in-the-middle, password-guessing, traceability, and ephemeral-secret-leakage attacks while preserving anonymity and forward secrecy. Formal analysis in the Real-Or-Random model proves session-key indistinguishability against classical polynomial-time adversaries under the CMDLP/CMCDHP assumptions. Compared with a recent ASCON-based three-party baseline, the scheme reduces total computation and communication costs by 28.8% and 28.7%, respectively. These results show a practical security-efficiency balance for resource-constrained healthcare wearables.
- 19 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. PP, 1
Efficient Edge Deployment of Mixture-of-Experts Models with Hybrid Expert Quantization
Deploying large language models (LLMs) directly at the edge offers significant benefits in reducing inference latency and enhancing privacy protection. However, this approach presents critical technical challenges due to the limited hardware resources available at the edge. In this paper, we explore the deployment of the Mixture-of-Experts (MoE) model, a popular LLM architecture, using weight quantization in a typical edge environment with multiple edge servers. Existing methods that uniformly quantize MoE models do not account for the varying importance of different experts or the dynamic nature of edge requests. To address these issues, we propose a hybrid expert quantization strategy, where each edge server quantizes experts to different bit-widths based on the preferences of received requests. Furthermore, we implement a comprehensive system optimization that jointly considers expert quantization and request assignment, aiming to achieve high-precision and low-latency inference services. To manage the complex, coupled optimization challenges, we design a reinforcement learning (RL)-based algorithm. To overcome the slow convergence typical of traditional RL, we pre-train the policy network using a system simulator that generates heuristic solutions, thus accelerating the learning process. Extensive experimental results on real datasets demonstrate that our approach significantly outperforms existing methods.
- 19 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. PP, 1
Efficient Edge Deployment of Mixture-of-Experts Models with Hybrid Expert Quantization
Deploying large language models (LLMs) directly at the edge offers significant benefits in reducing inference latency and enhancing privacy protection. However, this approach presents critical technical challenges due to the limited hardware resources available at the edge. In this paper, we explore the deployment of the Mixture-of-Experts (MoE) model, a popular LLM architecture, using weight quantization in a typical edge environment with multiple edge servers. Existing methods that uniformly quantize MoE models do not account for the varying importance of different experts or the dynamic nature of edge requests. To address these issues, we propose a hybrid expert quantization strategy, where each edge server quantizes experts to different bit-widths based on the preferences of received requests. Furthermore, we implement a comprehensive system optimization that jointly considers expert quantization and request assignment, aiming to achieve high-precision and low-latency inference services. To manage the complex, coupled optimization challenges, we design a reinforcement learning (RL)-based algorithm. To overcome the slow convergence typical of traditional RL, we pre-train the policy network using a system simulator that generates heuristic solutions, thus accelerating the learning process. Extensive experimental results on real datasets demonstrate that our approach significantly outperforms existing methods.
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2699-2710
Compliance-to-Code : Enhancing Financial Compliance Checking via Code Generation
Nowadays, regulatory compliance has become a cornerstone of corporate governance, ensuring adherence to systematic legal frameworks. At its core, financial regulations often comprise highly intricate provisions, layered logical structures, and numerous exceptions, which inevitably result in labor-intensive or comprehension challenges. To mitigate this, recent Regulatory Technology (RegTech) and Large Language Models (LLMs) have gained significant attention in automating the conversion of regulatory text into executable compliance logic. However, their performance remains suboptimal particularly when applied to Chinese-language financial regulations, due to three key limitations: (1) incomplete domain-specific knowledge representation, (2) insufficient hierarchical reasoning capabilities, and (3) failure to maintain temporal and logical coherence. One promising solution is to develop a domain specific and code-oriented dataset for model training. Existing datasets such as LexGLUE, LegalBench, and CODE-ACCORD are often English-focused, domain-mismatched, or lack fine-grained granularity for compliance code generation. To fill these gaps, we present Compliance-to-Code, the first large-scale Chinese dataset dedicated to financial regulatory compliance. Covering 1,159 annotated clauses from 361 regulations across ten categories, each clause is modularly structured with four logical elements-subject, condition, constraint, and contextual information-along with regulation relations. We provide deterministic Python code mappings, detailed code reasoning, and code explanations to facilitate automated auditing. To demonstrate utility, we present FinCheck: a pipeline for regulation structuring, code generation, and report generation. Compliance-to-Code establishes a new benchmark for LLM-based compliance automation. Experimental evaluation shows that GLM-4-9B-0414 achieves the best performance on key task in regulation structuring and DeepSeek-R1-0528 performs the best in compliance code generation tasks.
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2699-2710
Open AccessCompliance-to-Code : Enhancing Financial Compliance Checking via Code Generation
Nowadays, regulatory compliance has become a cornerstone of corporate governance, ensuring adherence to systematic legal frameworks. At its core, financial regulations often comprise highly intricate provisions, layered logical structures, and numerous exceptions, which inevitably result in labor-intensive or comprehension challenges. To mitigate this, recent Regulatory Technology (RegTech) and Large Language Models (LLMs) have gained significant attention in automating the conversion of regulatory text into executable compliance logic. However, their performance remains suboptimal particularly when applied to Chinese-language financial regulations, due to three key limitations: (1) incomplete domain-specific knowledge representation, (2) insufficient hierarchical reasoning capabilities, and (3) failure to maintain temporal and logical coherence. One promising solution is to develop a domain specific and code-oriented dataset for model training. Existing datasets such as LexGLUE, LegalBench, and CODE-ACCORD are often English-focused, domain-mismatched, or lack fine-grained granularity for compliance code generation. To fill these gaps, we present Compliance-to-Code, the first large-scale Chinese dataset dedicated to financial regulatory compliance. Covering 1,159 annotated clauses from 361 regulations across ten categories, each clause is modularly structured with four logical elements-subject, condition, constraint, and contextual information-along with regulation relations. We provide deterministic Python code mappings, detailed code reasoning, and code explanations to facilitate automated auditing. To demonstrate utility, we present FinCheck: a pipeline for regulation structuring, code generation, and report generation. Compliance-to-Code establishes a new benchmark for LLM-based compliance automation. Experimental evaluation shows that GLM-4-9B-0414 achieves the best performance on key task in regulation structuring and DeepSeek-R1-0528 performs the best in compliance code generation tasks.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 2316-2331
CPID-MAAC: RL for Joint User Association and Trajectory Control in UAV-Assisted MEC Systems
Existing joint user association and trajectory control (JUATC) methods provide remarkably high data rates for mobile users (MUs) in unmanned aerial vehicle (UAV)-assisted multi-access edge computing systems. Nevertheless, current methods give more attention to the uplink and downlink of MU, which must be associated with the same UAV or base station (BS), ignoring the network’s heterogeneity and considerably reducing the MU’s communication efficiency. Furthermore, UAVs typically provide communication services to MUs under partial observation, leading to challenges in achieving optimal service performance due to information loss. Moreover, although existing solutions can readily reach optimal, restriction-fulfilling strategies, they frequently breach restrictions during intermediate iterations. To address these issues, we present a fully decentralized JUATC algorithm based on the Communication and Proportional-Integral-Derivative (PID) Lagrangian-based Multi-Agent Actor-Critic (CPID-MAAC). First, to improve communication efficiency, we consider that each MU can be associated with a different UAV or BS in the uplink and downlink. Second, we establish a messaging mechanism between UAVs based on autoencoding UAV’s observations to handle the information loss. Finally, to alleviate constraint-violating behavior, we incorporate the PID Lagrangian algorithm. The experiments show that CPID-MAAC improves data rate by 7.88%~16.03% and drastically reduces the number of constraint violations during UAV agent training.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 2316-2331
CPID-MAAC: RL for Joint User Association and Trajectory Control in UAV-Assisted MEC Systems
Existing joint user association and trajectory control (JUATC) methods provide remarkably high data rates for mobile users (MUs) in unmanned aerial vehicle (UAV)-assisted multi-access edge computing systems. Nevertheless, current methods give more attention to the uplink and downlink of MU, which must be associated with the same UAV or base station (BS), ignoring the network’s heterogeneity and considerably reducing the MU’s communication efficiency. Furthermore, UAVs typically provide communication services to MUs under partial observation, leading to challenges in achieving optimal service performance due to information loss. Moreover, although existing solutions can readily reach optimal, restriction-fulfilling strategies, they frequently breach restrictions during intermediate iterations. To address these issues, we present a fully decentralized JUATC algorithm based on the Communication and Proportional-Integral-Derivative (PID) Lagrangian-based Multi-Agent Actor-Critic (CPID-MAAC). First, to improve communication efficiency, we consider that each MU can be associated with a different UAV or BS in the uplink and downlink. Second, we establish a messaging mechanism between UAVs based on autoencoding UAV’s observations to handle the information loss. Finally, to alleviate constraint-violating behavior, we incorporate the PID Lagrangian algorithm. The experiments show that CPID-MAAC improves data rate by 7.88%~16.03% and drastically reduces the number of constraint violations during UAV agent training.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2811-2820
Hearing the Meaning, Not the Mess: Beyond Literal Transcription for Spoken Language
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2811-2820
Open AccessHearing the Meaning, Not the Mess: Beyond Literal Transcription for Spoken Language
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 73-82
FedWCM: Unleashing the Potential of Momentum-based Federated Learning in Long-Tailed Scenarios
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 73-82
Open AccessFedWCM: Unleashing the Potential of Momentum-based Federated Learning in Long-Tailed Scenarios
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 4590-4598
A Fraudulent Blind Shipment Detection Framework in Logistics
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 4590-4598
Open AccessA Fraudulent Blind Shipment Detection Framework in Logistics
- 29 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6943-6954
Attack Analysis and Enhanced Authentication Protocol Design for Vehicle Networks
Vehicular Ad-hoc Networks (VANETs) face significant security and privacy challenges in modern intelligent transportation systems. This paper analyzes vulnerabilities in Al-Shareeda et al.'s vehicle authentication protocol (doi: 10.1109/TDSC.2025.3553868) and proposes an enhanced ECC-based scheme using short-lived pseudonymous certificates. We identify two critical weaknesses in Al-Shareeda et al.'s protocol—a desynchronization attack causing potential denial-of-service and an identity linking attack compromising vehicle privacy. Our protocol establishes mutual authentication between vehicles and roadside units, ensuring message integrity, anonymity, and perfect forward secrecy. Unlike existing approaches, it eliminates the need for online third-party authenticators. Formal security proofs demonstrate that the scheme's security is reducible to the hardness of the ECDLP and CDH problems. Performance analysis shows our approach achieves an optimal security-efficiency balance with competitive communication overhead (4608 bits) and computation costs (5.02 ms) compared to state-of-the-art alternatives, while uniquely satisfying all twelve evaluated security properties.
- 29 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6943-6954
Attack Analysis and Enhanced Authentication Protocol Design for Vehicle Networks
Vehicular Ad-hoc Networks (VANETs) face significant security and privacy challenges in modern intelligent transportation systems. This paper analyzes vulnerabilities in Al-Shareeda et al.'s vehicle authentication protocol (doi: 10.1109/TDSC.2025.3553868) and proposes an enhanced ECC-based scheme using short-lived pseudonymous certificates. We identify two critical weaknesses in Al-Shareeda et al.'s protocol—a desynchronization attack causing potential denial-of-service and an identity linking attack compromising vehicle privacy. Our protocol establishes mutual authentication between vehicles and roadside units, ensuring message integrity, anonymity, and perfect forward secrecy. Unlike existing approaches, it eliminates the need for online third-party authenticators. Formal security proofs demonstrate that the scheme's security is reducible to the hardness of the ECDLP and CDH problems. Performance analysis shows our approach achieves an optimal security-efficiency balance with competitive communication overhead (4608 bits) and computation costs (5.02 ms) compared to state-of-the-art alternatives, while uniquely satisfying all twelve evaluated security properties.
- 29 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 403-418
Lightweight and Fast Authentication Protocol for Digital Healthcare Services
With the rapid expansion of the Internet of Medical Things (IoMT) and cloud computing, ensuring secure communication in e-health systems has become increasingly critical. However, many existing authentication solutions suffer from excessive overhead and security vulnerabilities. To address these challenges, we present a lightweight, high-speed authentication protocol that relies on secure hash functions and XOR operations, facilitating efficient mutual authentication among users, trusted servers, and medical servers while establishing session keys for data exchange. We then rigorously assess our protocol’s security against a comprehensive threat model, employing both informal methods and formal analyses, including Real-Or-Random (ROR) model, BAN logic, and automated verification via ProVerif. The results demonstrate that our protocol remains resilient against known attacks and satisfies e-health security standards. Furthermore, a detailed performance comparison reveals that our approach significantly reduces some costs compared to existing schemes, while reinforcing security and privacy protections.
- 29 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 403-418
Lightweight and Fast Authentication Protocol for Digital Healthcare Services
With the rapid expansion of the Internet of Medical Things (IoMT) and cloud computing, ensuring secure communication in e-health systems has become increasingly critical. However, many existing authentication solutions suffer from excessive overhead and security vulnerabilities. To address these challenges, we present a lightweight, high-speed authentication protocol that relies on secure hash functions and XOR operations, facilitating efficient mutual authentication among users, trusted servers, and medical servers while establishing session keys for data exchange. We then rigorously assess our protocol’s security against a comprehensive threat model, employing both informal methods and formal analyses, including Real-Or-Random (ROR) model, BAN logic, and automated verification via ProVerif. The results demonstrate that our protocol remains resilient against known attacks and satisfies e-health security standards. Furthermore, a detailed performance comparison reveals that our approach significantly reduces some costs compared to existing schemes, while reinforcing security and privacy protections.