FLFangxiao Li

Fangxiao Li

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    BAPPS: A Blockchain-Assisted Privacy-Preserving Sharing Scheme for Secure Data Exchange in the Internet of Vehicles

    by Lin Wang, Ke Chen, Fangxiao Li, Leyi Shi

    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.

  • Open Access

    Blockchain-Enabled Decentralized End Hopping for Proactive Network Defense

    by Shenghan Luo, Fangxiao Li, Leyi Shi, Dawei Zhao

    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

    Whispers in End Hopping: High-Robustness Network Covert Channel Based on End Spreading

    by Zhengwen Wang, Fangxiao Li, Leyi Shi

    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.

  • CMTD:A fast Moving Target Defense Scheme based on CFL Authentication

    by Fangxiao Li, Leyi Shi, Yuchen Zhao, Haoyu Zhang, Zhihao Zhao, Qiang Han

    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.