Junchao Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Junchao Fan has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Xiaolin Chang
Beijing Jiaotong University
16 shared publications - Jelena Mišić
Department of Computer Science, Toronto Metropolitan University, Toronto, ON, Canada
9 shared publications - Vojislav B. Misic
Department of Computer Science, Toronto Metropolitan University, Toronto, ON, Canada
9 shared publications - Yanwei Gong
Beijing Key Laboratory of Security and Privacy in Intelligent Transportation, Beijing Jiaotong University, P.R.China
7 shared publications - Ruichen Zhang
Nanyang Technological University
4 shared publications - Hongyue Kang
Dept Intelligent Supply Chain, JD Logist, Beijing, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (11) , 4025-4039
Trusted Runtime Customizable TEE on FPGA-SoC with User-Controllable TPM
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (11) , 4025-4039
Trusted Runtime Customizable TEE on FPGA-SoC with User-Controllable TPM
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 43540-43553
Sparse Threats, Focused Defense: Criticality-Aware Robust Reinforcement Learning for Safe Autonomous Driving
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 43540-43553
Sparse Threats, Focused Defense: Criticality-Aware Robust Reinforcement Learning for Safe Autonomous Driving
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. PP, 1-16
Towards Robust PBFT Consensus: SMP Modeling and Grouping Optimization of Hierarchical Node Architecture
Consensus mechanisms are essential to distributed networked systems, ensuring consistent state agreement under unreliable communication and node failures. Among such mechanisms, Practical Byzantine Fault Tolerance (PBFT) has been widely adopted in practice and extensively extended through numerous variants to address scalability in large-scale and heterogeneous networks. However, they still lack 1) adaptability to dynamic changes in network topology or fault distribution, and/or 2) capability of mitigating the gap between the consensus system behavior quantification and the consensus optimization approaches. These degrade consensus robustness in terms of consensus probability and consensus response time. To address these challenges, we first propose a hierarchical node architecture for PBFT. We then develop a scalable Semi-Markov Process (SMP)-based analytical model that captures the stochastic, time-dependent evolution of consensus states across multiple layers. Numerical and simulation results confirm the model's accuracy and show that the hierarchical structure sustains reliable operation up to 30% faulty nodes while maintaining low latency. Building on this modeling foundation, we propose a reinforcement learning-based optimization approach that formulates hierarchical grouping as a Markov decision process and solves it using proximal policy optimization. Experimental evaluation demonstrates that our approach improves consensus probability and reduces latency compared with static grouping baselines.
- 31 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. PP, 1-16
Towards Robust PBFT Consensus: SMP Modeling and Grouping Optimization of Hierarchical Node Architecture
Consensus mechanisms are essential to distributed networked systems, ensuring consistent state agreement under unreliable communication and node failures. Among such mechanisms, Practical Byzantine Fault Tolerance (PBFT) has been widely adopted in practice and extensively extended through numerous variants to address scalability in large-scale and heterogeneous networks. However, they still lack 1) adaptability to dynamic changes in network topology or fault distribution, and/or 2) capability of mitigating the gap between the consensus system behavior quantification and the consensus optimization approaches. These degrade consensus robustness in terms of consensus probability and consensus response time. To address these challenges, we first propose a hierarchical node architecture for PBFT. We then develop a scalable Semi-Markov Process (SMP)-based analytical model that captures the stochastic, time-dependent evolution of consensus states across multiple layers. Numerical and simulation results confirm the model's accuracy and show that the hierarchical structure sustains reliable operation up to 30% faulty nodes while maintaining low latency. Building on this modeling foundation, we propose a reinforcement learning-based optimization approach that formulates hierarchical grouping as a Markov decision process and solves it using proximal policy optimization. Experimental evaluation demonstrates that our approach improves consensus probability and reduces latency compared with static grouping baselines.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-16
Towards Reliable Service Provisioning for Dynamic UAV Clusters in Low-Altitude Economy Networks
Unmanned Aerial Vehicle (UAV) cluster services are crucial for promoting the low-altitude economy by enabling scalable, flexible, and adaptive aerial networks. To meet diverse service demands, clusters must dynamically incorporate a New UAVs (NUAVs) or an Existing UAV (EUAV). However, achieving sustained service reliability remains challenging due to the need for efficient and scalable NUAV authentication, privacy-preserving cross-cluster authentication for EUAVs, and robust protection of the cluster session key, including both forward and backward secrecy. To address these challenges, we propose a Lightweight and Privacy-Preserving Cluster Authentication and Session Key Update (LP2-CASKU) scheme tailored for dynamic UAV clusters in low-altitude economy networks. LP2-CASKU integrates an efficient batch authentication mechanism that simultaneously authenticates multiple NUAVs with minimal communication overhead. It further introduces a lightweight cross-cluster authentication mechanism that ensures EUAV anonymity and unlinkability. Additionally, a secure session key update mechanism is incorporated to maintain key confidentiality over time, thereby preserving both forward and backward secrecy. We provide a comprehensive security analysis and evaluate LP2-CASKU performance through both theoretical analysis and OMNeT++ simulations. Experimental results demonstrate that, compared to the baseline, LP2 CASKU achieve salatency reduction of 82.8%–90.8% by across different UAV swarm configurations and network bitrates, demonstrating strong adaptability to dynamic communication environments. Besides, under varying UAV swarm configurations, LP2-CASKU reduces the energy consumption by approximately 37.6%–72.6%, while effectively supporting privacy-preserving authentication in highly dynamic UAVcluster environments. A demonstration video is available at: https://github.com/BJTU-STIC/UAV-simulation-demonstration.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-16
Towards Reliable Service Provisioning for Dynamic UAV Clusters in Low-Altitude Economy Networks
Unmanned Aerial Vehicle (UAV) cluster services are crucial for promoting the low-altitude economy by enabling scalable, flexible, and adaptive aerial networks. To meet diverse service demands, clusters must dynamically incorporate a New UAVs (NUAVs) or an Existing UAV (EUAV). However, achieving sustained service reliability remains challenging due to the need for efficient and scalable NUAV authentication, privacy-preserving cross-cluster authentication for EUAVs, and robust protection of the cluster session key, including both forward and backward secrecy. To address these challenges, we propose a Lightweight and Privacy-Preserving Cluster Authentication and Session Key Update (LP2-CASKU) scheme tailored for dynamic UAV clusters in low-altitude economy networks. LP2-CASKU integrates an efficient batch authentication mechanism that simultaneously authenticates multiple NUAVs with minimal communication overhead. It further introduces a lightweight cross-cluster authentication mechanism that ensures EUAV anonymity and unlinkability. Additionally, a secure session key update mechanism is incorporated to maintain key confidentiality over time, thereby preserving both forward and backward secrecy. We provide a comprehensive security analysis and evaluate LP2-CASKU performance through both theoretical analysis and OMNeT++ simulations. Experimental results demonstrate that, compared to the baseline, LP2 CASKU achieve salatency reduction of 82.8%–90.8% by across different UAV swarm configurations and network bitrates, demonstrating strong adaptability to dynamic communication environments. Besides, under varying UAV swarm configurations, LP2-CASKU reduces the energy consumption by approximately 37.6%–72.6%, while effectively supporting privacy-preserving authentication in highly dynamic UAVcluster environments. A demonstration video is available at: https://github.com/BJTU-STIC/UAV-simulation-demonstration.
- 26 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (8) , 12041-12057
Safe and Economical UAV Trajectory Planning in Low-Altitude Airspace: A Hybrid DRL-LLM Algorithm With Compliance Awareness
The rapid growth of the low-altitude economy has driven the widespread adoption of unmanned aerial vehicles (UAVs). This growing deployment presents new challenges for UAV trajectory planning in complex urban environments. However, existing studies often overlook key factors, such as urban airspace constraints and economic efficiency, which are essential in low-altitude economy contexts. Deep reinforcement learning (DRL) is regarded as a promising solution to these issues, while its practical adoption remains limited by low learning efficiency. To overcome this limitation, we propose a novel UAV trajectory planning algorithm that integrates DRL with the large language model (LLM) reasoning to enable safe, compliant, and economically viable trajectory planning. Specifically, we model the trajectory planning task as a partially observable Markov decision process, explicitly incorporating obstacle avoidance, regulation awareness, and energy constraints. We design a hybrid optimization algorithm based on the soft actor-critic algorithm and LLM reasoning to enable adaptive decision-making in uncertain and dynamic environments. Experimental results demonstrate that our algorithm achieves the best overall performance, with the highest data collection rate (99.50%), almost zero collision avoidance rate and regulation violation rate, a successful landing rate of nearly 100%, and the lowest energy consumption rate (76.95%). These results validate the effectiveness of our algorithm in addressing UAV trajectory planning key challenges under constraints of the low-altitude economy networking.
- 26 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (8) , 12041-12057
Safe and Economical UAV Trajectory Planning in Low-Altitude Airspace: A Hybrid DRL-LLM Algorithm With Compliance Awareness
The rapid growth of the low-altitude economy has driven the widespread adoption of unmanned aerial vehicles (UAVs). This growing deployment presents new challenges for UAV trajectory planning in complex urban environments. However, existing studies often overlook key factors, such as urban airspace constraints and economic efficiency, which are essential in low-altitude economy contexts. Deep reinforcement learning (DRL) is regarded as a promising solution to these issues, while its practical adoption remains limited by low learning efficiency. To overcome this limitation, we propose a novel UAV trajectory planning algorithm that integrates DRL with the large language model (LLM) reasoning to enable safe, compliant, and economically viable trajectory planning. Specifically, we model the trajectory planning task as a partially observable Markov decision process, explicitly incorporating obstacle avoidance, regulation awareness, and energy constraints. We design a hybrid optimization algorithm based on the soft actor-critic algorithm and LLM reasoning to enable adaptive decision-making in uncertain and dynamic environments. Experimental results demonstrate that our algorithm achieves the best overall performance, with the highest data collection rate (99.50%), almost zero collision avoidance rate and regulation violation rate, a successful landing rate of nearly 100%, and the lowest energy consumption rate (76.95%). These results validate the effectiveness of our algorithm in addressing UAV trajectory planning key challenges under constraints of the low-altitude economy networking.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (1) , 29-42
Monero-Based Group Covert Transmission With Fine-Grained Access Control
Public Blockchain-based covert transmission (CT) can address the limitations of traditional CT methods. Monero is a blockchain-based cryptocurrency with strong privacy protection techniques. However, existing Monero-based CT methods are limited to unicast scenarios. If applied directly to group CT scenarios, they would lead to a significant increase in transaction volume as the number of receivers increases. Meanwhile, existing Bitcoin/Ethereum-based group CT methods at least face three challenges, including susceptibility to key and identity inference attacks, information leakage during off-chain negotiations, and exposure of communication channels. This paper proposes a Monero-Based Group CT approach (MBGCT), which enables on-chain group key (used for receivers to filter covert transactions and extract messages) issuance, fine-grained access control of messages, and covert transaction identification and decryption isolation. MBGCT can ensure confidentiality of group keys, unforgeability of messages, integrity of each transmitted message, obscurity of covert channels, isolation of key generation from key management, and enhanced anonymity. As a result, MBGCT can not only prevent information leakage and channel exposure, but also resist the attacks of entity impersonation, data tampering, key and identity inference. We implemented MBGCT in Monero client v0.18.1.0, and validated its capability of high embedding rates, low transaction fees, and high execution efficiency on the Monero public chain Stagenet.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (1) , 29-42
Monero-Based Group Covert Transmission With Fine-Grained Access Control
Public Blockchain-based covert transmission (CT) can address the limitations of traditional CT methods. Monero is a blockchain-based cryptocurrency with strong privacy protection techniques. However, existing Monero-based CT methods are limited to unicast scenarios. If applied directly to group CT scenarios, they would lead to a significant increase in transaction volume as the number of receivers increases. Meanwhile, existing Bitcoin/Ethereum-based group CT methods at least face three challenges, including susceptibility to key and identity inference attacks, information leakage during off-chain negotiations, and exposure of communication channels. This paper proposes a Monero-Based Group CT approach (MBGCT), which enables on-chain group key (used for receivers to filter covert transactions and extract messages) issuance, fine-grained access control of messages, and covert transaction identification and decryption isolation. MBGCT can ensure confidentiality of group keys, unforgeability of messages, integrity of each transmitted message, obscurity of covert channels, isolation of key generation from key management, and enhanced anonymity. As a result, MBGCT can not only prevent information leakage and channel exposure, but also resist the attacks of entity impersonation, data tampering, key and identity inference. We implemented MBGCT in Monero client v0.18.1.0, and validated its capability of high embedding rates, low transaction fees, and high execution efficiency on the Monero public chain Stagenet.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (11) , 20249-20263
A2E: Attribute-Based Anonymity-Enhanced Authentication for Accessing Driverless Taxi Service
Driverless taxis (DTs) are gaining attention for their potential to improve urban transportation efficiency. However, unforeseen incidents caused by unsupervised users and the personalized needs of passengers in DTs highlight the need for authenticating user identities and attributes. Additionally, protecting user privacy while enabling rapid traceability of malicious users remains a challenge for the widespread adoption of DTs. This paper proposes a novel Attribute-based Anonymity Enhanced (A2E) authentication scheme for users to access DT services. The security capabilities of A2E include: 1) A2E is attribute-based authentication, which is achieved by designing a user attribute credential. Meanwhile, this attribute credential also satisfies unlinkability. And 2) A2E has enhanced anonymity, which is achieved by designing a decentralized credential issuance mechanism, safeguarding user attributes from association with anonymous identities. Moreover, this mechanism provides traceability and non-frameability to users. From the performance aspect, A2E causes low overhead when tracing malicious users and updating credentials. Besides, both scalability and lightweight are satisfied, which contributes to A2E’s practicability. We conduct security and performance analysis to validate these capabilities.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (11) , 20249-20263
A2E: Attribute-Based Anonymity-Enhanced Authentication for Accessing Driverless Taxi Service
Driverless taxis (DTs) are gaining attention for their potential to improve urban transportation efficiency. However, unforeseen incidents caused by unsupervised users and the personalized needs of passengers in DTs highlight the need for authenticating user identities and attributes. Additionally, protecting user privacy while enabling rapid traceability of malicious users remains a challenge for the widespread adoption of DTs. This paper proposes a novel Attribute-based Anonymity Enhanced (A2E) authentication scheme for users to access DT services. The security capabilities of A2E include: 1) A2E is attribute-based authentication, which is achieved by designing a user attribute credential. Meanwhile, this attribute credential also satisfies unlinkability. And 2) A2E has enhanced anonymity, which is achieved by designing a decentralized credential issuance mechanism, safeguarding user attributes from association with anonymous identities. Moreover, this mechanism provides traceability and non-frameability to users. From the performance aspect, A2E causes low overhead when tracing malicious users and updating credentials. Besides, both scalability and lightweight are satisfied, which contributes to A2E’s practicability. We conduct security and performance analysis to validate these capabilities.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 552-567
Towards Verifiable Trust Proof for Trusted Confidential Virtual Machines
Trusted-Execution-Environment (TEE)-based Confidential Virtual Machines (CVMs) deployed in public clouds currently lack verifiable trust proof of their running state, undermining remote users’ confidence in using them. While Virtual Trusted Platform Module (vTPM) techniques can be leveraged to generate such proof for CVMs, existing vTPM-based approaches suffer from three key weaknesses: lack of a well-defined root-of-trust, lack of vTPM protection, and lack of vTPM's trust proof. Consequently, it is hard for these approaches to generate verifiable trust proof to represent the states of remote users’ CVMs. This paper proposes T3CVM, an approach that leverages vTPM to generate verifiable trust proof for remote users’ AMD SEV-based CVMs. T3CVM comprises three components and a trusted boot scheme to overcome the weaknesses of the existing state-of-the-art approaches and then increase user's confidence in the trust proof. Our approach allows trusted computing-based applications to run seamlessly in the trusted CVM. Additionally, our approach can be extended to the CVMs based on other VM-based TEE technologies, such as Intel TDX. We formally analyze T3CVM's security and evaluate its performance through a prototype implementation.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 552-567
Towards Verifiable Trust Proof for Trusted Confidential Virtual Machines
Trusted-Execution-Environment (TEE)-based Confidential Virtual Machines (CVMs) deployed in public clouds currently lack verifiable trust proof of their running state, undermining remote users’ confidence in using them. While Virtual Trusted Platform Module (vTPM) techniques can be leveraged to generate such proof for CVMs, existing vTPM-based approaches suffer from three key weaknesses: lack of a well-defined root-of-trust, lack of vTPM protection, and lack of vTPM's trust proof. Consequently, it is hard for these approaches to generate verifiable trust proof to represent the states of remote users’ CVMs. This paper proposes T3CVM, an approach that leverages vTPM to generate verifiable trust proof for remote users’ AMD SEV-based CVMs. T3CVM comprises three components and a trusted boot scheme to overcome the weaknesses of the existing state-of-the-art approaches and then increase user's confidence in the trust proof. Our approach allows trusted computing-based applications to run seamlessly in the trusted CVM. Additionally, our approach can be extended to the CVMs based on other VM-based TEE technologies, such as Intel TDX. We formally analyze T3CVM's security and evaluate its performance through a prototype implementation.
- 14 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 30215-30227
Less Is More: A Stealthy and Efficient Adversarial Attack Method for DRL-Based Autonomous Driving Policies
Existing research has demonstrated that autonomous driving policies based on deep reinforcement learning (DRL) are vulnerable to adversarial attacks, which poses challenges for the practical deployment of these policies. Designing effective adversarial attacks is a crucial prerequisite for building robust driving policies. In view of this, we propose a novel adversarial attack method, which can attack the DRL-based autonomous driving agents in a stealthy and efficient manner. This method models the attack as a mixed-integer optimization problem that aims to maximize the safety violations (e.g., collisions) of the agents while minimizing the number of attack steps. Then, a DRL-based adversary is devised in this method to solve the problem to automatically learn the optimal attack policy without domain knowledge. To further enhance the adversary’s learning capability, this method incorporates attack-related information into its observations to provide more decision-making context and employ a trajectory clipping technique to enhance sample quality. Extensive evaluation results reveal that our method achieves a remarkable 105% enhancement in attack efficiency compared to existing methods.
- 14 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 30215-30227
Less Is More: A Stealthy and Efficient Adversarial Attack Method for DRL-Based Autonomous Driving Policies
Existing research has demonstrated that autonomous driving policies based on deep reinforcement learning (DRL) are vulnerable to adversarial attacks, which poses challenges for the practical deployment of these policies. Designing effective adversarial attacks is a crucial prerequisite for building robust driving policies. In view of this, we propose a novel adversarial attack method, which can attack the DRL-based autonomous driving agents in a stealthy and efficient manner. This method models the attack as a mixed-integer optimization problem that aims to maximize the safety violations (e.g., collisions) of the agents while minimizing the number of attack steps. Then, a DRL-based adversary is devised in this method to solve the problem to automatically learn the optimal attack policy without domain knowledge. To further enhance the adversary’s learning capability, this method incorporates attack-related information into its observations to provide more decision-making context and employ a trajectory clipping technique to enhance sample quality. Extensive evaluation results reveal that our method achieves a remarkable 105% enhancement in attack efficiency compared to existing methods.
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (11) , 17569-17580
Toward Lightweight and Privacy-Preserving Data Provision in Digital Forensics for Driverless Taxi
Data provision, referring to data upload and data access, is one key phase in vehicular digital forensics. The unique features of Driverless Taxi (DT) bring new issues to this phase: I1) efficient verification of data integrity when diverse Data Providers (DPs) upload data; I2) DP privacy preservation during data upload; and I3) privacy preservation of both data and INvestigator (IN) under complex data ownership when accessing data. Considering that the existing works on digital forensics cannot address all these issues, we first propose a novel Lightweight and Privacy-preserving Data Provision (LPDP) approach consisting of three mechanisms: 1) Privacy-friendly Batch Verification Mechanism (PBVm), 2) Data Access Control Mechanism (DACm), and 3) Decentralized IN Warrant Issuance Mechanism (DIWIm). PBVm ensures scalable verification of data integrity to address I1. PBVm also ensures the DP privacy preservation in terms of the location privacy and unlinkability of data upload requests to address I2. Besides, DACm and DIWIm are combined to ensure data privacy preservation and the identity privacy of IN in terms of the anonymity and unlinkability of data access requests without sacrificing the traceability to address I3. Security analysis and performance evaluations validate LPDP’s capabilities in addressing the three issues.
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (11) , 17569-17580
Toward Lightweight and Privacy-Preserving Data Provision in Digital Forensics for Driverless Taxi
Data provision, referring to data upload and data access, is one key phase in vehicular digital forensics. The unique features of Driverless Taxi (DT) bring new issues to this phase: I1) efficient verification of data integrity when diverse Data Providers (DPs) upload data; I2) DP privacy preservation during data upload; and I3) privacy preservation of both data and INvestigator (IN) under complex data ownership when accessing data. Considering that the existing works on digital forensics cannot address all these issues, we first propose a novel Lightweight and Privacy-preserving Data Provision (LPDP) approach consisting of three mechanisms: 1) Privacy-friendly Batch Verification Mechanism (PBVm), 2) Data Access Control Mechanism (DACm), and 3) Decentralized IN Warrant Issuance Mechanism (DIWIm). PBVm ensures scalable verification of data integrity to address I1. PBVm also ensures the DP privacy preservation in terms of the location privacy and unlinkability of data upload requests to address I2. Besides, DACm and DIWIm are combined to ensure data privacy preservation and the identity privacy of IN in terms of the anonymity and unlinkability of data access requests without sacrificing the traceability to address I3. Security analysis and performance evaluations validate LPDP’s capabilities in addressing the three issues.