LHLongxia Huang

Longxia Huang

*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


Longxia Huang has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Privacy-Preserving Delegable Auditing Scheme with Edge-Assisted Deduplication in IoT

    by Chunfei Pan, Lei Zhou, Longxia Huang, Jiajia Chen, Kang Zhang, Anmin Fu

  • Open Access

    AI-Driven Cooperative Control for Autonomous Tractors and Implements: A Comprehensive Review

    by Hongjie Jia, Weipeng Chen, Zhihao Su, Yaozu Sun, Zhengpeng Qian, Longxia Huang

    Artificial intelligence (AI) is driving the evolution of autonomous agriculture towards multi-agent collaborative control, breaking through the limitations of traditional isolated automation. Although existing research has focused on hierarchical control and perception-decision-making technologies for agricultural machinery, the overall integration of these elements in building a resilient physical perception collaborative system is still insufficient. This paper systematically reviews the progress of AI-driven tractor-implement cooperative control from 2018 to 2025, focusing on four major technical pillars: (1) perception-decision-execution hierarchical architecture, (2) distributed multi-agent collaborative framework, (3) physical perception modeling and adaptive control, and (4) staged operation applications (such as collaborative harvesting). The research reveals core challenges such as real-time collaborative planning, perception robustness under environmental disturbances, and collaborative control and safety assurance under operational disturbances. To this end, three solutions are proposed: an AI framework for formalizing agronomic constraints and mechanical dynamics; a disturbance-resistant adaptive tractor-implement cooperative control strategy; and a real-time collaborative ecosystem integrating neuromorphic computing and FarmOS. Finally, a research roadmap is summarized with agronomic constraint reinforcement learning, self-reconfigurable collaboration, and biomechanical mechatronic systems as the core. By integrating the scattered progress in AI, robotics and agronomy, we provide theoretical foundation and practical guidance for scalable and sustainable autonomous farm systems.


  • FiDD: Secure Fine-Grained Deduplication and Dynamic Auditing Scheme for Cloud Storage

    by Longxia Huang, Xue Mao, Lei Zhou, Di Wu, Longxiang Gao, Tom H. Luan

    With the rapid development of cloud computing, more and more users tend to store their data remotely to the cloud. Taking into account data security and resource utilization comprehensively, in addition to providing users with basic remote data integrity verification, cloud servers also need to conduct redundancy checks. However, current deduplication schemes primarily focus on static file-level data and auditing processes, rendering them inadequate for managing resources with dynamic attributes. In this paper, we propose a fine-grained deduplication and dynamic auditing model (FiDD) for cloud storage to address these challenges. FiDD utilizes homomorphic verifier-based data tags to seamlessly integrate deduplication and auditing processes, allowing both block-level and file-level deduplications. Additionally, FiDD employs doubly linked lists and multi-set hash functions to enhance the efficiency of data updates. The security of FiDD is validated through rigorous security proofs, while its efficiency is demonstrated through comprehensive experimental analysis. The experiments demonstrate an average improvement of at least 35% in audit efficiency and at least 50% in dynamics efficiency. Consequently, FiDD enhanes the security of data management in cloud computing while improving its overall efficiency.


  • BDEA: blockchain-based secure deduplication for low-entropy data supporting public auditing

    by Longxia Huang, Xue Mao, Chengzhi Ge

    In cloud storage, deduplication techniques are essential for improving storage capacity. Low-entropy data, due to its predictable structure, pose security risks and challenges for convergent encryption, which can compromise semantic security and increase the likelihood of information leakage. To address these issues, robust auditing mechanisms tailored for low-entropy data are essential. Although double-layer encryption strategies have been suggested to enhance security, they often introduce significant overhead and do not ensure ownership verification or auditing for low-entropy data. To address these limitations, we propose BDEA, a blockchain-based secure deduplication scheme specifically designed for low-entropy data that improves security while enabling public auditing capabilities. BDEA employs advanced technologies such as random keys, Bloom filters, and chameleon hash functions to facilitate secure and efficient deduplication processes tailored for low-entropy datasets. The integration of blockchain technology with Rivest-Shamir-Adleman (RSA) signatures enhances the security and transparency of data integrity audits in cloud environments. Security analysis confirms the robustness of the BDEA scheme, while experimental results demonstrate its effectiveness. In Ubuntu 20.04, this scheme achieves approximately an 80% reduction in deduplication processes and a 70% decrease in audit verification time when applied to datasets ranging from 2 to 16 MB at intervals of 2 MB.

  • DARB: Decentralized, Accountable and Redactable Blockchain for Data Management

    by Longxia Huang, Chengzhi Ge, Xue Mao, Shui Yu

    Blockchain technology, known for its immutable distributed ledger, which greatly improves the credibility of data management in various applications. However, the immutability may result in erroneous data being permanently stored in the blockchain, affecting the security of the blockchain system. To address this issue, redactable blockchain is proposed to allow flexibly modifications of erroneous data in blockchain. Despite their promise, current redactable blockchain solutions often fall short in balancing two critical aspects: decentralization and data accountability. In this paper, we propose a Decentralized, Accountable and Redactable Blockchain solution (DARB). Our solution aims to mitigate the risks associated with central authority while ensuring secure accountability in data modification processes. Decentralization is achieved by using authorized authorities instead of the central authority, utilizing decentralized ciphertext policy attribute-based encryption. Additionally, it incorporates traceable ring signatures, which enable the authorized authorities to collaborate effectively in holding edited data accountable and tracing the identity of malicious modifiers. The security analysis and experimental results demonstrate that the DARB scheme successfully facilitates secure data rewriting and ensures accountability, all while maintaining an acceptable level of additional time overhead.


  • MPC+: Secure, Compatible and Efficient Off-Blockchain Multi-Node Payment Channel

    by Longxia Huang, Hao Lei, Liangmin Wang

    Payment channels (PC) greatly improve blockchain scalability by allowing an unlimited number of off-chain transactions instead of committing every transaction to the blockchain. However, the payment channel structure is limited to only two nodes, which is inadequate in scenarios where one node frequently receives money from multiple nodes, such as Cafe. Recent proposals have extended the 2-node structure to a multi-node structure. Unfortunately, these approaches either require all participants to always be online, which is not realistic, or underestimate the efficiency problem of withdrawing funds, leading to higher fees and storage costs. What’s worse, the payment scope in these proposals is limited to their respective structures and is not mutually compatible. In this paper, we propose MPC+, a smart contract that enables multiple nodes to engage in off-chain transactions. MPC+ is designed to cater to scenarios where one node frequently receives money from multiple nodes, such as Cafe, shops, and more. The nodes in MPC+ can conduct off-chain transactions internally or with nodes in existing payment channel networks externally, and they only need to be online during off-chain transactions. Furthermore, MPC+ enhances the withdrawal logic through a binding strategy, effectively reducing the number of on-chain transactions required for fund withdrawals from O(n) to O(1), and it works over any blockchain system that supports Turing-complete smart contracts. The security is formally proven under the Universal Composability framework, and it is specifically implemented on the Ethereum platform. The experimental results clearly demonstrate that MPC+ surpasses other designs in terms of fees and storage costs.


  • An Efficient Cloudlet Deployment Method Based on Approximate Graph Cut in Large-scale WMANs

    by Longxia Huang, Changzhi Huo, Xing Zhang, Hongjie Jia

  • Blockchain Enables Your Bill Safer

    by Qin Wang, Longxia Huang, Shiping Chen, Yang Xiang

    As one of the most frequently used Internet-of-Things (IoT) devices, energy smart meter has been widely adopted to facilitate the measures of residential energy use. Residents pay for the bills from energy suppliers according to their monthly/seasonal usage. Practically, there is a demand from residents/governments to check whether the bills are in line with their real consumptions. However, it is challenging to realize this demand due to two critical problems. The first problem refers to the nonrepudiated privacy issue caused by access to residents’ energy consumption history (e.g., data integrity may be questioned, and residents’ daily timetables may be exposed). The second problem comes from the efficiency requirement for bulk auditing requests on residents’ bills and consumptions, usually risen by governments. So far, we have not found any solutions that can be directly used in this case. In this article, we propose using homomorphic encryption cooperated with the blockchain technique to leverage the data auditing and privacy-preserving requirements. We also employe a certificateless signature to resolve the efficiency bottleneck in batch auditing. This framework, called pAuditChain, not only accepts personal requests from residents for consumption checking but also handles bulk auditing requests issued by governments. To validate the correctness of the framework functions, we carried out a series of theoretical analysis, especially on the privacy preserving and auditing processes. To the best of our knowledge, the proposed framework is among the first solutions to improve the security and privacy of bills without losing the auditing function. Our approach concerns with IoT smart meters in energy supply industries and could be further extended to other forms of IoT devices with the bill demands.


  • Open Access

    Certificateless Public Verification for Data Storage and Sharing in the Cloud

    by Longxia Huang, Junlong Zhou, Gongxuan Zhang, Mingyue Zhang

    By advances in cloud computing, users are allowed to remotely store their data in the cloud, manage the stored data without limitation of time and place, and give rights to visitors that want to access to their data. As may no longer possess data physically, the data owner has to ensure the integrity of the data with the public key given by Public key infrastructure (PKI). However, there are many security risks of the traditional PKI and the certificate management is complex. We utilize elliptic curve group to propose a certificateless signature to solve the above problem. To check the integrity of files stored in the cloud, we design a certificateless public verification mechanism based on the signature and further extend it to support batch auditing tasks. Meanwhile, an efficient key updating method is proposed to provide visitors a friendly data success environment. The security analysis proves that the proposed scheme is secure under the discrete logarithm assumption. Extensive theoretical analyses and experimental results show the effectiveness of the proposed scheme.