Yao Liu

Yao Liu

Auto-generated profile, based on publicly available information

Yao Liu

University of South Florida

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
14 December 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
XLXingyu Li
Xingyu Li
ZQZhe Qu
Zhe Qu
SZShangqing Zhao
Shangqing Zhao
Bo TangBo Tang
Bo Tang
ZLZhuo Lu
Zhuo Lu
YLYao Liu
Yao Liu
Federated learning (FL) provides a high efficient decentralized machine learning framework, where the training data remains distributed at remote clients in a network. Though FL enables a privacy-preserving mobile edge computing framework using IoT devices, recent studies have shown that this approach is susceptible to poisoning attacks from the side of remote clients. To address the poisoning attacks on FL, we provide a two-phase defense algorithm called Local Malicious Factor (LoMar). In phase I, LoMar scores model updates from each remote client by measuring the relative distribution over their neighbors using a kernel density estimation method. In phase II, an optimal threshold is approximated to distinguish malicious and clean updates from a statistical perspective. Comprehensive experiments on four real-world datasets have been conducted, and the experimental results show that our defense strategy can effectively protect the FL system. Specifically, the defense performance on Amazon dataset under a label-flipping attack indicates that, comparing with FG+Krum, LoMar increases the target label testing accuracy from $96.0\%$ to $98.8\%$ , and the overall averaged testing accuracy from 90.1% to $97.0%.

28 June 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZQZhe Qu
Zhe Qu
RDRui Duan
Rui Duan
LCLixing Chen
Lixing Chen
JXJie Xu
Jie Xu
ZLZhuo Lu
Zhuo Lu
YLYao Liu
Yao Liu
Federated Learning (FL) has been considered as an appealing framework to tackle data privacy issues of mobile devices compared to conventional Machine Learning (ML). Using Edge Servers (ESs) as intermediaries to perform model aggregation in proximity can reduce the transmission overhead, and it enables great potential in low-latency FL, where the hierarchical architecture of FL (HFL) has been attracted more attention. Designing a proper client selection policy can significantly improve training performance, and it has been widely investigated in conventional FL studies. However, to the best of our knowledge, systematic client selection policies have not yet been fully studied for HFL. In addition, client selection for HFL faces more challenges than conventional FL (e.g., the time-varying connection of client-ES pairs and the limited budget of the Network Operator (NO)). In this article, we investigate a client selection problem for HFL, where the NO learns the number of successful participating clients to improve training performance (i.e., select as many clients in each round) as well as under the limited budget on each ES. An online policy, called Context-aware Online Client Selection (COCS), is developed based on Contextual Combinatorial Multi-Armed Bandit (CC-MAB). COCS observes the side-information (context) of local computing and transmission of client-ES pairs and makes client selection decisions to maximize NO's utility given a limited budget. Theoretically, COCS achieves a sublinear regret compared to an Oracle policy on both strongly convex and non-convex HFL. Simulation results also support the efficiency of the proposed COCS policy on real-world datasets.

13 January 2015 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
TWTao Wang
Tao Wang
YLYao Liu
Yao Liu
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos

18 August 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
ZQZhe Qu
Zhe Qu
XLXingyu Li
Xingyu Li
JXJie Xu
Jie Xu
Bo TangBo Tang
Bo Tang
ZLZhuo Lu
Zhuo Lu
YLYao Liu
Yao Liu
Multi-server Federated learning (FL) has been considered as a promising solution to address the limited communication resource problem of single-server FL. We consider a typical multi-server FL architecture, where the coverage areas of regional servers may overlap. The key point of this architecture is that the clients located in the overlapping areas update their local models based on the average model of all accessible regional models, which enables indirect model sharing among different regional servers. Due to the complicated network topology, the convergence analysis is much more challenging than in single-server FL. In this paper, we firstly propose a novel MS-FedAvg algorithm for this multi-server FL architecture and analyze its convergence on non-iid datasets for general non-convex settings. Since the number of clients located in each regional server is much less than single-server FL, the bandwidth of each client should be large enough to successfully communicate training models with the server, which indicates that full client participation can work in multi-server FL. Also, we provide the convergence analysis of the partial client participation scheme and develop a new biased partial participation strategy to further accelerate convergence. Our results indicate that the convergence results highly depend on the ratio of the number of clients in each area type to the total number of clients in all three strategies. The extensive experiments show remarkable performance and support our theoretical results.

15 October 2018
Verified
Conference Paper
Open access
PDF file
SFSong Fang
Song Fang
IMIan Markwood
Ian Markwood
YLYao Liu
Yao Liu
SZShangqing Zhao
Shangqing Zhao
ZLZhuo Lu
Zhuo Lu
HZHaojin Zhu
Haojin Zhu

7 March 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
ZPZiyue Pan
Ziyue Pan
WSWenbo Shen
Wenbo Shen
XWXingkai Wang
Xingkai Wang
YYYutian Yang
Yutian Yang
RCRui Chang
Rui Chang
KRKui Ren
Kui Ren
The continuous integration and continuous deployment (CI/CD) pipeline has been widely used and is becoming popular on Internet hosting platforms, such as GitHub. While being popular, however, current CI/CD pipelines suffer from malicious code and severe vulnerabilities. Even worse, it is often under-protected as people have not been fully aware of its attack surfaces and the corresponding impacts. Therefore, in this paper, we conduct a large-scale measurement and a systematic analysis to reveal the attack surfaces of the CI/CD pipeline and quantify their security impacts. Specifically, for the measurement, we collect a data set of 320,000+ CI/CD pipeline-configured GitHub repositories and build an analysis tool to parse the CI/CD pipelines and extract security-critical usages. Our measurement reveals that the script runtimes are prone to code hiding while the script usage update is not in time, giving attackers chances to hide malicious code and exploit existing vulnerabilities. Moreover, even the scripts from verified creators may contain severe vulnerabilities. Besides current CI/CD ecosystem heavily relies on several core scripts, which may lead to a single point of failure. While the CI/CD pipelines contain sensitive information/operations, making them the attacker's favorite targets. Inspired by the measurement findings, we abstract the threat model and the attack approach toward CI/CD pipelines, followed by a systematic analysis of attack surfaces, attack strategies, and the corresponding impacts. We further launch case studies on five attacks in real-world CI/CD environments to validate the revealed attack surfaces. Finally, we give suggestions on mitigating attacks on CI/CD scripts, including securing CI/CD configurations, securing CI/CD scripts, and improving CI/CD infrastructure.