QLQi Li

Qi 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

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Qi Li has a total of 69 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Blockchain-Assisted Revocable and Efficient ABSE Scheme for Secure Medical Data Sharing

    by Gao Hancheng, Wu Xiaoyu, Haiping Huang, Li Qi, Xing Yizheng

    Efficient and privacy-preserving medical data sharing remains a key challenge in the era of digital healthcare. Existing schemes often suffer from limited access control, substantial computational overhead, and reliance on trusted third parties. This article proposes a revocable Attribute-Based Searchable Encryption (ABSE) scheme built upon a hierarchical blockchain architecture, which enables a secure keyword search over encrypted data via expressive attribute-based access policies, and a revocation mechanism is integrated to support dynamic user management. We design a lightweight and privacy-preserving computation framework that offloads expensive cryptographic operations to the cloud, thereby reducing the burden on user-side devices. Furthermore, we propose a lightweight consensus protocol, termed lottery consensus, which replaces traditional proof-of-work hash computations with meaningful operations that are tied to the ABSE-based data-sharing process. Extensive theoretical analysis and simulation experiments demonstrate the superior efficiency of the proposed scheme, and formal security proofs demonstrate its robustness against threats.


  • A Controllable, Publicly Auditable, and Redactable Blockchain With a Main–Auxiliary Architecture

    by Lingyan Xue, Haiping Huang, Fu Xiao, Qi Li, Wenming Wang

    Redactable blockchains are challenging the core principle of traditional blockchains: immutability. One such example is the chameleon hash-based blockchain. Despite rapid academic advances, most solutions have not yet simultaneously considered four key aspects: the degree of modification privileges, the transparency of the modification process, the consistency in the post-redaction global state, and system security after redaction. In this paper, we present a controllable, publicly auditable, and redactable blockchain with a main-auxiliary architecture. Specifically, we integrate weighted secret sharing, digital signature, and non-interactive zero-knowledge proof technologies to propose a verifiable and controllable chameleon hash primitive. To encourage logical nodes, it includes a reputation evaluation mechanism and a DAO-based governance model. Additionally, we construct a redactable bi-directionally anchored main-auxiliary blockchain structure, where the auxiliary chain exclusively maintains the modification proofs associated with each block of main chain. Any node can audit the modification history or, in the event of an accusation, self-prove. This structure also simplifies global state updates for newly joined or restarted nodes. Finally, we provide comprehensive security proofs for our construction, conduct extensive experiments to evaluate its functionality and performance, and compare it with analogous solutions to demonstrate its superiority.

  • STORChain: A Clustered-MPT-Based Blockchain for Data Service and Efficient Storage in Healthcare

    by Hancheng Gao, Mohammad S. Obaidat, Haiping Huang, Yizheng Xing, Fu Xiao, Qi Li

    The adoption of blockchain technology in healthcare has significantly enhanced data integrity, transparency, and user privacy. However, high storage overhead and resource-intensive operations remain major challenges to its widespread deployment, particularly in large-scale or resource-constrained healthcare environments. To address these challenges, we propose STORChain, a storage-optimized blockchain framework designed for data services in healthcare. The framework introduces the Clustered Merkle Patricia Tree (C-MPT), a novel logical structure that aggregates similar transaction types to maximize storage efficiency while ensuring Proof of Inclusion (PoI). A Selective Transaction Pruning Strategy (STPS) is employed to prioritize and prune essential historical data, improving data access efficiency. Additionally, an incentive-based Delegated Proof-of-Stake (DPoS) consensus algorithm is utilized, integrating a probabilistic election mechanism to promote fairness and node inclusivity. Comprehensive theoretical analysis and practical experiment results indicate that STORChain significantly reduces storage overhead, optimizes data access, and outperforms existing schemes.


  • GeoFed: Geometry-Aware Byzantine Robust Federated Learning on SPD Manifolds in Heterogeneous Environments

    by Qi Li, Zhenzhen Wu, Jinbo Xiong, Anxiao Song, Tao Zhang

    Federated learning (FL) has been increasingly applied in the Internet of Things (IoT), leveraging its decentralized nature to facilitate collaboration among clients and enable resource-constrained clients to jointly train a globally optimal model based on consensus. However, it is difficult to confirm data authenticity and participant integrity due to the unobservability of local training procedures and the inaccessibility of local training data. As a result, FL is highly susceptible to Byzantine attacks, including data poisoning and model poisoning, which can manipulate the training process and degrade model performance. Moreover, IoT data is often highly heterogeneous and high-dimensional, rendering most existing Byzantine-robust FL approaches ineffective in practical scenarios. To address this challenge, we propose GeoFed, which iteratively filters out malicious clients based on the geodesic distance between clients. This geodesic distance is measured on the Riemannian manifold spanned by the covariance of local gradient update. To further mitigate the impact of data heterogeneity, GeoFed assigns a weight factor to each client after removing Byzantine attackers, optimizing the accuracy and flexibility of global model aggregation according to the quality of client data. We conduct extensive experimental evaluations of GeoFed under various Byzantine attack scenarios and highly heterogeneous data environments. To validate the efficacy of GeoFed, we provide a theoretical analysis of its convergence properties. The results demonstrate that GeoFed outperforms state-of-the-art Byzantine-robust FL approaches in heterogeneous IoT settings. Especially, under different Byzantine attacks, the accuracy of detecting malicious clients on the heterogeneous MNIST dataset approaches 100%.


  • Open Access

    Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

    by Qi Li, Gaozhan Liu, Qianqian Zhang, Lidong Han, Wei Chen, Rui Li, Jinbo Xiong


  • A Privacy-Enhanced Traceable Anonymous Transaction Scheme for Blockchain

    by Lingyan Xue, Haiping Huang, Fu Xiao, Qi Li, Zhiwei Wang

    Blockchain transaction privacy is a highly researched topic across various application scenarios. Current privacy-preserving schemes in blockchain employ advanced cryptographic techniques, such as homomorphic encryption and zero-knowledge proofs, to balance transaction privacy with regulatory requirements. However, these schemes encounter challenges, including computational inefficiency, data expansion, and over-looked metadata privacy, such as timestamp protection. In this paper, we first propose a privacy-enhanced traceable anonymous transaction scheme based on data transaction scenarios. This scheme integrates ring signature and Merkle hash tree techniques, effectively shortening the signature size and optimizing the verification process compared to existing combinations of ring signatures and zero-knowledge proofs. A novel verifiable timestamp privacy protection method is introduced, which obfuscates timestamps to prevent tampering without compromising integrity. To enhance scalability, this method extends to multiple transaction processing scenarios and implements a timestamp-sharing strategy to reduce the computational burden. It also allows tracking authorities to monitor the long-term addresses of both transaction parties if necessary. Rigorous security analysis and extensive experimental evaluations demonstrate that this scheme achieves superior privacy, traceability, and scalability compared to existing approaches.


  • Privacy-Preserving Outsourcing Learning for Connected Autonomous Vehicles: Challenges, Solutions, and Perspectives

    by Jinbo Xiong, Renwan Bi, Yuanyuan Zhang, Qi Li, Li Lin, Youliang Tian

    Although data sharing and fusion between connected autonomous vehicles (CAVs) can effectively enhance environment awareness and improve driving safety, it has to face severe challenges of privacy disclosure. Outsourcing encrypted data to edge servers for data analysis and model learning can alleviate this issue without imposing additional computing load on CAVs. In this article, we propose a privacy-preserving outsourcing learning (PPOL) framework based on lightweight additive secret sharing (ASS). Firstly, we propose a privacy-preserving outsourcing object detection method over secretly shared image and point cloud data. Secondly, we construct a privacy-preserving outsourcing depth estimation model over fused stereo image shares, aiming to provide a feasible solution for outsourcing data fusion and learning. Finally, we point out open issues under the PPOL framework, and give research perspectives in aspects of privacy-preserving data fusion for multi-frame, multi-modal and multi-view data, as well as privacy-preserving model optimization.


  • Decentralized Access Control for Privacy-Preserving Cloud-Based Personal Health Record With Verifiable Policy Update

    by Haoyuan Fan, Qi Li, Jinbo Xiong, Rui Li, Wei Chen, Haiping Huang

    With the advancement of cloud computing technology, the cloud-based personal health record (CB-PHR) has become an increasingly popular way for modern patients to flexibly manage and share their health records with doctors. However, the confidentiality of CB-PHR privacy is vulnerable to threats due to unauthorized users and untrusted cloud service provider (CSP). Additionally, patients and doctors may be constrained by changes in access permissions and limited device resources. To address these challenges, we propose an efficient decentralized privacy-preserving attribute-based access control scheme with verifiable policy update (DPVPU) for CB-PHR systems. DPVPU supports large attribute universe and safeguards the privacy of both the access policy and the doctor’s identity through partially hiding the access policy and employing a one-way anonymous key agreement technique. Unlike re-encrypting ciphertext, it can dynamically update the policy by fully utilizing the previous policy and outsourcing the computation of ciphertext update to the CSP. Also, we design an efficient verification algorithm enabling patients to check the correctness of updated ciphertext. For devices with limited resources, we use online/offline and outsourced decryption techniques to reduce system costs. Finally, we provide formal security proofs and performance analysis to demonstrate the security and practicality of DPVPU.