Fangxiao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fangxiao Li has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Leyi Shi
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China
5 shared publications Bingtao Ding
1 shared publication- Haoyu Zhang
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, China
1 shared publication - Ke Chen
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China
1 shared publication - Lin Wang
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China
1 shared publication Pengfei Yu
1 shared publication
Latest Publications
- Open Access
- 28 August 2026
- Published by MDPI AG in Electronics
- Vol. 15 (17) , 3882
BAPPS: A Blockchain-Assisted Privacy-Preserving Sharing Scheme for Secure Data Exchange in the Internet of Vehicles
The Internet of Vehicles (IoV) is evolving into a distributed electronic sensing and communication infrastructure in which vehicles, roadside units, and service platforms continuously exchange data for intelligent transportation services. However, cross-organization sharing of vehicle-borne sensing data can expose identity links, location traces, task routes, and raw sensor content. This paper proposes BAPPS, a Blockchain-Assisted Privacy-Preserving Sharing Scheme for Secure Data Exchange in the Internet of Vehicles. BAPPS combines anonymous identity issuance, zk-SNARK-based data-quality verification, elliptic-curve proxy re-encryption, and on-chain audit records. Data owners can prove that encrypted observations satisfy task-specific quality or access constraints without disclosing raw data, while a semi-honest service provider transforms ciphertexts only under authorization. The consortium blockchain records task publication, access verification, proof submission, and data-hash evidence, enabling traceable sharing without exposing plaintext observations. We further implement a Tendermint-style BFT consensus layer, denoted BAPPS-T, to reduce confirmation latency in the data-sharing workflow. Using the three available real Tendermint benchmark workbooks as repeated records, BAPPS-T achieved a mean consensus latency of 776.3 ms at 100 nodes (SD = 80.8 ms, n = 3, 95% CI = 575.5–977.1 ms), corresponding to a 90.17% latency reduction relative to Baseline 1. The results indicate that BAPPS can provide a reproducible protocol layer for trusted, privacy-aware sharing of mobile electronics observations under explicit deployment assumptions.
- 28 August 2026
- Published by MDPI AG in Electronics
- Vol. 15 (17) , 3882
Open AccessBAPPS: A Blockchain-Assisted Privacy-Preserving Sharing Scheme for Secure Data Exchange in the Internet of Vehicles
The Internet of Vehicles (IoV) is evolving into a distributed electronic sensing and communication infrastructure in which vehicles, roadside units, and service platforms continuously exchange data for intelligent transportation services. However, cross-organization sharing of vehicle-borne sensing data can expose identity links, location traces, task routes, and raw sensor content. This paper proposes BAPPS, a Blockchain-Assisted Privacy-Preserving Sharing Scheme for Secure Data Exchange in the Internet of Vehicles. BAPPS combines anonymous identity issuance, zk-SNARK-based data-quality verification, elliptic-curve proxy re-encryption, and on-chain audit records. Data owners can prove that encrypted observations satisfy task-specific quality or access constraints without disclosing raw data, while a semi-honest service provider transforms ciphertexts only under authorization. The consortium blockchain records task publication, access verification, proof submission, and data-hash evidence, enabling traceable sharing without exposing plaintext observations. We further implement a Tendermint-style BFT consensus layer, denoted BAPPS-T, to reduce confirmation latency in the data-sharing workflow. Using the three available real Tendermint benchmark workbooks as repeated records, BAPPS-T achieved a mean consensus latency of 776.3 ms at 100 nodes (SD = 80.8 ms, n = 3, 95% CI = 575.5–977.1 ms), corresponding to a 90.17% latency reduction relative to Baseline 1. The results indicate that BAPPS can provide a reproducible protocol layer for trusted, privacy-aware sharing of mobile electronics observations under explicit deployment assumptions.
- 25 June 2026
- Published by Elsevier in Computers & Security
- Vol. 170
An enhanced Network Topology Obfuscation strategy incorporating delay characteristics against side-channel attacks
- 25 June 2026
- Published by Elsevier in Computers & Security
- Vol. 170
An enhanced Network Topology Obfuscation strategy incorporating delay characteristics against side-channel attacks
- Open Access
Blockchain-Enabled Decentralized End Hopping for Proactive Network Defense
As network attack methods continue to evolve, flooding attacks remain a major threat that causes network paralysis and service disruption. Statically configured systems are particularly vulnerable, as attackers can exploit reconnaissance information to launch large-scale attacks, while conventional defense mechanisms often fail under high-intensity traffic. To address this problem, this paper introduces Moving Target Defense (MTD) within a decentralized framework and proposes a blockchain-based decentralized End Hopping system. The system employs the Practical Byzantine Fault Tolerance (PBFT) consensus protocol for dynamic controller election and incorporates a disaster recovery mechanism, which eliminates single points of failure while ensuring reliable controller transitions and rapid service restoration. Experimental results demonstrate that the proposed system achieves satisfactory performance in terms of availability, effectiveness, and security, providing a practical approach to constructing robust proactive defense networks.
Open AccessBlockchain-Enabled Decentralized End Hopping for Proactive Network Defense
As network attack methods continue to evolve, flooding attacks remain a major threat that causes network paralysis and service disruption. Statically configured systems are particularly vulnerable, as attackers can exploit reconnaissance information to launch large-scale attacks, while conventional defense mechanisms often fail under high-intensity traffic. To address this problem, this paper introduces Moving Target Defense (MTD) within a decentralized framework and proposes a blockchain-based decentralized End Hopping system. The system employs the Practical Byzantine Fault Tolerance (PBFT) consensus protocol for dynamic controller election and incorporates a disaster recovery mechanism, which eliminates single points of failure while ensuring reliable controller transitions and rapid service restoration. Experimental results demonstrate that the proposed system achieves satisfactory performance in terms of availability, effectiveness, and security, providing a practical approach to constructing robust proactive defense networks.
- Open Access
- 8 July 2025
- Published by MDPI AG in Information
- Vol. 16 (7) , 589
Whispers in End Hopping: High-Robustness Network Covert Channel Based on End Spreading
The massive use of end information in the end hopping system not only significantly improves the proactive defense capability but also reveals great potential for covert communication. However, the development of existing network covert channels is hindered by various elimination techniques and a lack of robustness guarantees. In this paper, we first present a novel network covert channel model based on end spreading (CCES) in the end hopping system. We then propose a CCES-based scheme using m-sequence in the hypothetical scenario and theoretically analyze its characteristics, including eavesdropping resistance, loss tolerance, and robust synchronization. To evaluate the performance of the CCES scheme, three evaluation metrics are adopted: non-detectability, robustness, and transmission efficiency. Experimental results show that CCES achieves a bit error rate (BER) below 5% under 30% packet loss, entropy values ranging from 0.15 to 0.82 (comparable to normal traffic), and a transmission efficiency of up to 800 bits per second. These results confirm the CCES scheme’s strong robustness and practical applicability, outperforming traditional covert channels in both reliability and stealth.
- 8 July 2025
- Published by MDPI AG in Information
- Vol. 16 (7) , 589
Open AccessWhispers in End Hopping: High-Robustness Network Covert Channel Based on End Spreading
The massive use of end information in the end hopping system not only significantly improves the proactive defense capability but also reveals great potential for covert communication. However, the development of existing network covert channels is hindered by various elimination techniques and a lack of robustness guarantees. In this paper, we first present a novel network covert channel model based on end spreading (CCES) in the end hopping system. We then propose a CCES-based scheme using m-sequence in the hypothetical scenario and theoretically analyze its characteristics, including eavesdropping resistance, loss tolerance, and robust synchronization. To evaluate the performance of the CCES scheme, three evaluation metrics are adopted: non-detectability, robustness, and transmission efficiency. Experimental results show that CCES achieves a bit error rate (BER) below 5% under 30% packet loss, entropy values ranging from 0.15 to 0.82 (comparable to normal traffic), and a transmission efficiency of up to 800 bits per second. These results confirm the CCES scheme’s strong robustness and practical applicability, outperforming traditional covert channels in both reliability and stealth.
- 3 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (1) , 1
CMTD:A fast Moving Target Defense Scheme based on CFL Authentication
With the development of Internet of Things (IoT), more and more devices are connected to the network. Moving Target Defense (MTD) provides a security solution for many IoT network devices. However, since MTD is deployed in a packet switching network, there are problems such as packet delay and congestion. Traditional follow-up synchronization scheme is not competent for high-rate change of MTD. This poses a serious security threat to IoT devices because slow rate changes are powerless in defending against highly adversarial network attacks. In this paper, we innovatively propose an MTD synchronization method, which uses synchronization certificates to complete synchronization. Furthermore, we establish a fast switching MTD (CMTD) model based on Cryptography Fundamental Logics (CFL). It improves MTD switching rate to milliseconds and solves the problem of synchronization in high speed hopping with high covert requirements. Theoretical analysis and experimental verification show that our method effectively improves the availability and concealment of IoT devices under high-speed hopping. It is of great significance for IoT security protection under high-intensity cyber attacks.
- 3 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (1) , 1
CMTD:A fast Moving Target Defense Scheme based on CFL Authentication
With the development of Internet of Things (IoT), more and more devices are connected to the network. Moving Target Defense (MTD) provides a security solution for many IoT network devices. However, since MTD is deployed in a packet switching network, there are problems such as packet delay and congestion. Traditional follow-up synchronization scheme is not competent for high-rate change of MTD. This poses a serious security threat to IoT devices because slow rate changes are powerless in defending against highly adversarial network attacks. In this paper, we innovatively propose an MTD synchronization method, which uses synchronization certificates to complete synchronization. Furthermore, we establish a fast switching MTD (CMTD) model based on Cryptography Fundamental Logics (CFL). It improves MTD switching rate to milliseconds and solves the problem of synchronization in high speed hopping with high covert requirements. Theoretical analysis and experimental verification show that our method effectively improves the availability and concealment of IoT devices under high-speed hopping. It is of great significance for IoT security protection under high-intensity cyber attacks.