Chao Liu

Dr. Chao Liu


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 March 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CLChao Liu
Chao Liu
BCBoxi Chen
Boxi Chen
Wei ShaoWei Shao
Wei Shao
Wenjun ZhangWenjun Zhang
Wenjun Zhang
KWKelvin K. L. Wong
Kelvin K. L. Wong
ZYZhang Yi
Zhang Yi
The advent of the Internet of Things (IoT) has brought forth an era of unprecedented connectivity, with an estimated 80 billion smart devices expected to be in operation by the end of 2025. These devices facilitate a multitude of smart applications, enhancing the quality of life and efficiency across various domains. Machine learning (ML) serves as a crucial technology, not only for analyzing IoT-generated data but also for diverse applications within the IoT ecosystem. For instance, ML finds utility in IoT device recognition, anomaly detection, and even in uncovering malicious activities. This article embarks on a comprehensive exploration of the security threats arising from ML’s integration into various facets of IoT, spanning various attack types, including membership inference, adversarial evasion, reconstruction, property inference, model extraction, and poisoning attacks. Unlike previous studies, our work offers a holistic perspective, categorizing threats based on criteria, such as adversary models, attack targets, and key security attributes (confidentiality, integrity, and availability). We delve into the underlying techniques of ML attacks in IoT environment, providing a critical evaluation of their mechanisms and impacts. Furthermore, our research thoroughly assesses 65 libraries, both author-contributed and third-party, evaluating their role in safeguarding model and data privacy. We emphasize the availability and usability of these libraries, aiming to arm the community with the necessary tools to bolster their defenses against the evolving threat landscape. Through our comprehensive review and analysis, this article seeks to contribute to the ongoing discourse on ML-based IoT security, offering valuable insights and practical solutions to secure ML models and data in the rapidly expanding field of artificial intelligence in IoT.

25 April 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HQHui Qiao
Hui Qiao
XDXuewen Dong
Xuewen Dong
QJQi Jiang
Qi Jiang
SMSiqi Ma
Siqi Ma
CLChao Liu
Chao Liu
YSYulong Shen
Yulong Shen
The impact of fog-assisted Healthcare IoT (H-IoT) system is immense. The smart H-IoT equipments can upload healthcare information to fog nodes with low latency and high mobility. To facilitate secure interactions among three parties, including smart H-IoT equipments, fog nodes and a cloud server, over the public and insecure channels, a few authenticated key agreement (AKA) protocols are proposed. However, existing works are constructed based on expensive cryptographic primitives (e.g., bilinear pairing), which lead to high computation costs. Besides, the anonymity of H-IoT users is failed to be provided. To tackle these issues, an anonymous and lightweight three-party AKA protocol ALAKAP is proposed, which leverages an efficient cryptographic primitive (i.e., Chebyshev chaotic map operation) to generate a shared session key among three parties and achieve security (anonymity and other six properties) and efficiency simultaneously. It then formally proves the security of ALAKAP under the broadly accepted Burrows-Abadi-Needham (BAN) logic model and demonstrates how the proposed protocol satisfies the desired requirements in the fog-assisted H-IoT system. Finally, the performance of ALAKAP is validated by conducting the experiments on Amazon EC2 and Raspberry Pi. The results show that our work can achieve at least 44% higher improvement than the state-of-the-art works.

12 July 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
CLChao Liu
Chao Liu
CHCankun Hou
Cankun Hou
TJTianyu Jiang
Tianyu Jiang
Jianting NingJianting Ning
Jianting Ning
HQHui Qiao
Hui Qiao
YWYusen WU
Yusen WU
Data-driven landscape across finance, government, and healthcare, the continuous generation of information demands robust solutions for secure storage, efficient dissemination, and fine-grained access control. Blockchain technology emerges as a significant tool, offering decentralized storage while upholding the tenets of data security and accessibility. However, on-chain and off-chain strategies are still confronted with issues such as untrusted off-chain data storage, absence of data ownership, limited access control policy for clients, and a deficiency in data privacy and auditability. To solve these challenges, we propose a permissioned blockchain-based privacy-preserving fine-grained access control on-chain and off-chain system, namely FACOS. We applied three fine-grained access control solutions and comprehensively analyzed them in different aspects, which provides an intuitive perspective for system designers and clients to choose the appropriate access control method for their systems. Compared to similar work that only stores encrypted data in centralized or non-fault-tolerant IPFS systems, we enhanced off-chain data storage security and robustness by utilizing a highly efficient and secure asynchronous Byzantine fault tolerance (BFT) protocol in the off-chain environment. As each of the clients needs to be verified and authorized before accessing the data, we involved the Trusted Execution Environment (TEE)-based solution to verify the credentials of clients. Additionally, our evaluation results demonstrated that our system ( https://github.com/cliu717/AsynchronousStorage ) offers better scalability and practicality than other state-of-the-art designs. We deployed our system on Alibaba Cloud and Tencent Cloud and conducted multiple evaluations. The results indicate that it takes about 2.79 seconds for a client to execute the protocol for uploading and about 0.96 seconds for downloading. Compared to other decentralized systems, our system exhibits efficient latency for both download and upload operations.

20 July 2022 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
HZHaibin Zhang
Haibin Zhang
CLChao Liu
Chao Liu
SDSisi Duan
Sisi Duan

18 March 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YCYusi Chen
Yusi Chen
YWYi Wu
Yi Wu
TWTianyou Wang
Tianyou Wang
SZShuo Zhang
Shuo Zhang
DZDaxin Zhu
Daxin Zhu
CLChao Liu
Chao Liu

8 May 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
CLChao Liu
Chao Liu
SDSisi Duan
Sisi Duan
HZHaibin Zhang
Haibin Zhang
State-of-the-art asynchronous Byzantine fault-tolerant (BFT) protocols, such as HoneyBadgerBFT, BEAT, and Dumbo, have shown performance comparable to partially synchronous BFT protocols. This paper studies two practical directions in asynchronous BFT. First, while all these asynchronous BFT protocols assume optimal resilience with $3f+1$ replicas (where $f$ is an upper bound on the number of Byzantine replicas), it is interesting to ask whether more efficient protocols are possible upon changing the resilience level. Second, these recent BFT protocols evaluate their performance under failure-free scenarios. It is unclear if these protocols indeed perform well during failures and attacks. This work first studies asynchronous BFT with suboptimal resilience using $5f+1$ and $7f+1$ replicas. We present MiB, a novel and efficient asynchronous BFT framework using new distributed system constructions as building blocks. MiB consists of two main BFT instances and five more variants. As another contribution, we systematically design experiments for asynchronous BFT protocols with failures and evaluate their performance in various failure scenarios. We report interesting findings, showing that asynchronous BFT performs consistently well during different failure scenarios. In particular, via a five-continent deployment on Amazon EC2 using 140 replicas, we show that the MiB instances have lower latency and much higher throughput than their asynchronous BFT counterparts.