Jiaqi Zhao

Jiaqi Zhao

Auto-generated profile, based on publicly available information

Jiaqi Zhao

Xidian University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
18 May 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JZJiaqi Zhao
Jiaqi Zhao
HZHui Zhu
Hui Zhu
FWFengwei Wang
Fengwei Wang
RLRongxing Lu
Rongxing Lu
ZLZhe Liu
Zhe Liu
HLHui Li
Hui Li
Over the past years, the increasingly severe data island problem has spawned an emerging distributed deep learning framework—federated learning, in which the global model can be constructed over multiple participants without directly sharing their raw data. Despite its promising prospect, there are still many security challenges in federated learning, such as privacy preservation and integrity verification. Furthermore, federated learning is usually performed with the assistance of a center, which is prone to cause trust worries and communicational bottlenecks. To tackle these challenges, in this paper, we propose a privacy-preserving and verifiable decentralized federated learning framework, named PVD-FL, which can achieve secure deep learning model training under a decentralized architecture. Specifically, we first design an efficient and verifiable cipher-based matrix multiplication (EVCM) algorithm to execute the most basic calculation in deep learning. Then, by employing EVCM, we design a suite of decentralized algorithms to construct the PVD-FL framework, which ensures the confidentiality of both global model and local update and the verification of every training step. Detailed security analysis shows that PVD-FL can well protect privacy against various inference attacks and guarantee training integrity. In addition, the extensive experiments on real-world datasets also demonstrate that PVD-FL can achieve lossless accuracy and practical performance.

29 April 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
WXWei Xu
Wei Xu
HZHui Zhu
Hui Zhu
YZYandong Zheng
Yandong Zheng
FWFengwei Wang
Fengwei Wang
JZJiaqi Zhao
Jiaqi Zhao
HLHui Li
Hui Li
With the rapid growth of Internet data volumes, big data analysis technologies have gradually permeated all aspects of life. However, the existence of data silos and the promulgation of relevant regulations make it challenging to apply these technologies. In this context, federated learning provides a feasible solution. Especially, XGBoost schemes for vertical federated learning have attracted much attention due to the widespread use of XGBoost. However, these schemes have limitations in terms of security or efficiency. To address these issues, we propose an efficient and privacy-preserving vertical federated learning framework based on the XGBoost algorithm, namely ELXGB, which achieves secure data alignment, XGboost training, and inference services. First, we design two node split algorithms based on homomorphic encryption and differential privacy, which securely and efficiently achieve tree node generation to construct the global model. Then, we utilize attribute obfuscation and direction obfuscation to achieve a secure inference algorithm, which avoids sensitive information leakage and protects the global model. Additionally, the global model of ELXGB is designed to be centralized, which does not require all participants to stay online for inference. Detailed security analysis demonstrates that ELXGB is privacy-preserving. Moreover, extensive experiments on real-world datasets indicate that ELXGB achieves high efficiency without sacrificing model accuracy.

28 December 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JZJiaqi Zhao
Jiaqi Zhao
HZHui Zhu
Hui Zhu
WXWei Xu
Wei Xu
FWFengwei Wang
Fengwei Wang
RLRongxing Lu
Rongxing Lu
HLHui Li
Hui Li
Aiming at balancing data privacy and availability, Google introduces the concept of federated learning, which can construct global machine learning models over multiple participants while keeping their raw data localized. However, the exchanged parameters in traditional federated learning may still reveal the data information. Meanwhile, the training data are usually partitioned vertically in real-world scenes, which causes difficulties in model construction. To tackle these problems, in this paper, we propose an efficient and privacy-preserving vertical federated tree boosting framework, namely SGBoost, where multiple participants can collaboratively perform model training and query without staying online all the time. Specifically, we first design secure bucket sharing and best split finding algorithms, with which the global tree model can be constructed over vertically partitioned data; meanwhile, the privacy of training data can be well guaranteed. Then, we design an oblivious query algorithm to utilize the trained model without leaking any query data or results. Moreover, SGBoost does not require multi-round interactions between participants, significantly improving the system efficiency. Detailed security analysis shows that SGBoost can well guarantee the privacy of raw data, weights, buckets, and split information. Extensive experiments demonstrate that SGBoost can achieve high accuracy comparable to centralized training and efficient performance.

22 February 2023 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
JZJiaqi Zhao
Jiaqi Zhao
HZHui Zhu
Hui Zhu
FWFengwei Wang
Fengwei Wang
RLRongxing Lu
Rongxing Lu
EWErmei Wang
Ermei Wang
HLHui Li
Hui Li
With the explosive growth of data volume and computing capability, federated learning, which involves constructing global models over multiple data islands, has demonstrated its advantages and vast prospects in the field of machine learning. However, due to commonly vertically partitioned data, coupled with privacy concerns about data leakage, there are still some challenging issues in traditional federated learning. To tackle these challenges, in this paper, we propose an efficient and privacy-preserving vertical federated learning framework for logistic regression, named VFLR, where multiple participants can collaboratively perform global model training and query over their vertically partitioned data. Specifically, we first design a data aggregation matrix construction algorithm, with which the vertically partitioned data can be aggregated for high-accuracy global model training. Then, by utilizing a novel symmetric homomorphic encryption, our framework can ensure that the whole training and query processes do not leak any private information. Moreover, based on the data aggregation matrix, multi-round interactions are not required in VFLR, improving training efficiency significantly. Detailed security analysis shows that VFLR can well protect data and model information from inference attacks. In addition, extensive experiments demonstrate that VFLR has high training and query accuracy and low computation and communication overhead.

20 March 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
JZJiaqi Zhao
Jiaqi Zhao
HZHui Zhu
Hui Zhu
FWFengwei Wang
Fengwei Wang
YZYandong Zheng
Yandong Zheng
RLRongxing Lu
Rongxing Lu
HLHui Li
Hui Li
The ever-growing data scale and increasingly strict privacy restraint have recently drawn extensive attention to federated learning (FL) as a multi-party machine learning paradigm for achieving high-quality model construction without data collection. Nevertheless, uploading local models in FL can still be exploited by adversaries to infer participants' sensitive data. Furthermore, it is possible for malicious participants to manipulate the global model by submitting poisonous local models. To tackle these challenges, this paper proposes an efficient and privacy-preserving federated learning framework against poisoning adversaries, namely ELFL, which can ensure the confidentiality of local models while effectively resisting data poisoning attacks. Specifically, we first design a grouped secure aggregation algorithm, through which the aggregation server can compute the summations of local models inside logic groups but cannot see individual ones. Then, based on grouped aggregations, our poisoning defense mechanism could detect and quickly phase out malicious participants from training candidates. Moreover, the computational complexity of participants is independent of their total number, so it is suitable for large-scale scenes. Detailed security analysis demonstrates the security of ELFL. Experimental results show that ELFL could maintain a high accuracy against representative data poisoning attacks, and its computational and communication overhead is indeed low.

19 April 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
QXQi Xu
Qi Xu
HZHui Zhu
Hui Zhu
YZYandong Zheng
Yandong Zheng
JZJiaqi Zhao
Jiaqi Zhao
RLRongxing Lu
Rongxing Lu
HLHui Li
Hui Li
With the popularity of intelligent terminals and the advances of mobile Internet, carpooling service, which reduces the travel cost of each user by allowing multiple users to share one car, has received considerable attention and makes our life more convenient. However, the vigorous development of carpooling services still faces severe challenges in users’ location or route privacy. In this article, we propose an efficient and privacy-preserving route matching scheme called TAROT for carpooling services. With TAROT, users can enjoy high-quality carpooling services while without revealing sensitive location and route information. Specifically, based on a Goldwasser–Micali-based equality determination algorithm (GMEDA), we design an accurate similarity computation algorithm (ASCA), which allows users to get accurate carpooling results over ciphertexts. Meanwhile, the reverse Minhash (RM) method is also designed to construct a dissimilar route filter algorithm (DRFA), which can filter out dissimilar routes in advance and reduce computational costs and communication overheads. Security analysis shows that TAROT can protect users’ location privacy. In addition, TAROT is also evaluated with many random maps, and the simulation results demonstrate that TAROT is highly efficient.