Li Chao

Dr. Li Chao


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
5 January 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
RXRunhua Xu
Runhua Xu
BLBo Li
Bo Li
Li ChaoLi Chao
Li Chao
JJJames B. D. Joshi
James B. D. Joshi
SMShuai Ma
Shuai Ma
JDJin Dong
Jin Dong
Federated learning is a computing paradigm that enhances privacy by enabling multiple parties to collaboratively train a machine learning model without revealing personal data. However, current research indicates that traditional federated learning platforms are unable to ensure privacy due to privacy leaks caused by the interchange of gradients. To achieve privacy-preserving federated learning, integrating secure aggregation mechanisms is essential. Unfortunately, existing solutions are vulnerable to recently demonstrated inference attacks such as the disaggregation attack. This paper proposes TAPFed , an approach for achieving privacy-preserving federated learning in the context of multiple decentralized aggregators with malicious actors. TAPFed uses a proposed threshold functional encryption scheme and allows for a certain number of malicious aggregators while maintaining security and privacy. We provide formal security and privacy analyses of TAPFed and compare it to various baselines through experimental evaluation. Our results show that TAPFed offers equivalent performance in terms of model quality compared to state-of-the-art approaches while reducing transmission overhead by 29%-45% across different model training scenarios. Most importantly, TAPFed can defend against recently demonstrated inference attacks caused by curious aggregators, which the majority of existing approaches are susceptible to.

15 September 2020
Verified
Book Chapter
Closed access
PDF file
Li ChaoLi Chao
Li Chao
BPBalaji Palanisamy
Balaji Palanisamy

20 April 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
RXRunhua Xu
Runhua Xu
JJJames Joshi
James Joshi
Li ChaoLi Chao
Li Chao
Training complex neural network models using third-party cloud-based infrastructure among multiple data sources is a promising approach among existing machine learning solutions. However, privacy concerns of large-scale data collections and recent regulations have restricted the availability and use of privacy sensitive data in the third-party infrastructure. To address such privacy issues, a promising emerging approach is to train a neural network model over an encrypted dataset. Specifically, the model training process can be outsourced to a third party such as a cloud service that is backed by significant computing power, while the encrypted training data keeps the data confidential from the third party. Compared to training a traditional machine learning model over encrypted data, however, it is extremely challenging to train a deep neural network (DNN) model over encrypted data for two reasons: first, it requires large-scale computation over huge datasets; second, the existing solutions for computation over encrypted data, such as using homomorphic encryption, is inefficient. Further, for enhanced performance of a DNN model, we also need to use huge training datasets composed of data from multiple data sources that may not have pre-established trust relationships among each other. We propose a novel framework, NN-EMD , to train DNN over encrypted multiple datasets collected from multiple sources. Toward this, we propose a set of secure computation protocols using hybrid functional encryption schemes. We evaluate our framework for performance with regards to the training time and model accuracy on the MNIST datasets. We show that compared to other existing frameworks, our proposed NN-EMD framework can significantly reduce the training time, while providing comparable model accuracy and privacy guarantees as well as supporting multiple data sources. Furthermore, the depth and complexity of neural networks do not affect the training time despite introducing a privacy-preserving NN-EMD setting.

7 January 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
GCGuorong Chen
Guorong Chen
WWWei Wang
Wei Wang
YWYufang Wu
Yufang Wu
Li ChaoLi Chao
Li Chao
Guangquan XuGuangquan Xu
Guangquan Xu
YHYufei Han
Yufei Han
Conventional federated learning (FL) coordinated by a central server focuses on training a global model and protecting the privacy of clients' training data by storing it locally. However, the statistical heterogeneity hinders the global model from adapting to the non-IID distributions among clients. Moreover, untrusted and unreliable central servers and malicious clients may compromise model integrity and availability, thus degrading the robustness of FL. To address these challenges, we present RobustPFL, a decentralized personalized federated learning (PFL) approach that combines $\alpha$ -based Layer-position Normalized Similarity ( $\alpha$ -LNS) and local collaborative training to improve personalized performance while utilizing a blockchain-based committee mechanism to coordinate the aggregation process, thereby achieving high personalized accuracy and robustness. Extensive experiments show that our RobustPFL approach outperforms multiple algorithms, including Local training, FedAvg, FedReptile, Per-FedAvg, FedBN, and SPFL, on MNIST, CIFAR10, EMNIST, and N-BaIoT datasets in four non-IID settings. We also evaluate RobustPFL's effectiveness against attacks—poisoning attacks and free-riding attacks. Particularly, for three prevalent poisoning attacks (backdoor, label flipping, and model poisoning attacks), we compare non-defensive (FedAvg) and defensive (Krum, trimmed mean, Bulyan, FedBN, FLAME, and FangTrmean) methods with our proposed RobustPFL. The results show that our approach achieves significant defensive effects.

21 August 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
GCGuorong Chen
Guorong Chen
Li ChaoLi Chao
Li Chao
WWWei Wang
Wei Wang
Li DuanLi Duan
Li Duan
BWBin Wang
Bin Wang
XZXiangliang Zhang
Xiangliang Zhang
Ensuring fairness in incentive mechanisms for federated learning (FL) is essential to attracting high-quality clients and building a sustainable FL ecosystem. Most existing fairness-aware incentive mechanisms distribute rewards to FL clients by quantifying their contributions to the performance of the global model. Essentially, these mechanisms pursue contribution fairness, namely a constant contribution-reward ratio across FL clients, with an implicit assumption that clients would be satisfied with the contribution fairness. However, research in social psychology has confirmed that this assumption may not hold in many real-world scenarios. According to equity theory proposed by Adams, an individual's assessment and perception of receiving fair treatment significantly depend on the input-outcome ratio, where outcome simply refers to the rewards, while input is far more complex because it involves a bunch of subtle factors such as enthusiasm, experience and tolerance as well as the estimated contributions. Inspired by Adams' equity theory, in this work, we expand the notion of contribution fairness to input fairness and propose a new fairness-aware incentive mechanism named FairReward that distributes rewards under the joint consideration of self-reported inputs and computed contributions. FairReward employs a reputation mechanism to enhance the credibility of self-reported inputs and leverages blockchains to eliminate the need of a trusted FL server and monetarily incentivize/penalize clients. In addition, FairReward adopts techniques including distributed differential privacy and locality-sensitive hashing to address privacy and non-IID issues in FL. Moreover, we conduct a comprehensive security and privacy analysis. Finally, we evaluate FairReward through extensive experiments. The comprehensive experimental results demonstrate that FairReward is effective, scalable and attack-resistant, and provides the input fairness required.

19 August 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
XXXiangrui Xu
Xiangrui Xu
WWWei Wang
Wei Wang
ZCZheng Chen
Zheng Chen
BWBin Wang
Bin Wang
Li ChaoLi Chao
Li Chao
YHYufei Han
Yufei Han
Vertical Federated Learning (VFL) is a collaborative learning paradigm where participants share the same sample space while splitting the feature space. In VFL, local participants host their bottom models for feature extraction and collaboratively train a classifier by exchanging intermediate results with the server owning the labels. Both local training data and bottom models contain privacy-sensitive information and are considered the intellectual property of each participant, and thus should be protected by the design of VFL. Our study exposes the fundamental susceptibility of VFL systems to privacy leaks, which arise from the collaboration between the server and clients during both training and testing. Based on our findings, we propose PISTE , a model-agnostic framework of privacy stealing attacks against VFL. PISTE delivers three privacy inference attacks, i.e., model stealing, data reconstruction, and property inference attacks on five benchmark datasets and four different model architectures. We further discuss four potential countermeasures. Experimental results show that all of them cannot prevent all three privacy stealing attacks in PISTE. In summary, our study demonstrates the inherent yet rarely uncovered vulnerability of VFL on leaking data and model privacy.