Jiaqi Xue

Jiaqi Xue

Auto-generated profile, based on publicly available information

Jiaqi Xue

University of Central Florida, Orlando, FL, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
19 November 2023
Verified
Conference Paper
Open access
JXJiaqi Xue
Jiaqi Xue
MZMengxin Zheng
Mengxin Zheng
YSYi Sheng
Yi Sheng
LYLei Yang
Lei Yang
QLQian Lou
Qian Lou
LJLei Jiang
Lei Jiang
Deep learning models play a crucial role in important sectors like healthcare, finance, and recruitment. However, these models can harbor biases and unfairness that may negatively impact those who rely on them. While there are algorithms designed to improve fairness, the resilience of these models to adversarial attacks, particularly the emerging threat of Trojan (or backdoor) attacks, has not been thoroughly examined. To address this gap, we introduce TrojFair, a Trojan fairness attack methodology. TrojFair creates a model that performs accurately and fairly under normal conditions but, when triggered, discriminates and produces incorrect results for specific groups. This type of attack is especially stealthy and dangerous as it can bypass existing fairness and trojan detection methods, appearing fair during regular use. Our results show that TrojFair achieves a success rate of over 88.77% in targeting specific groups, with a minimal average accuracy loss of less than 0.44%. Additionally, it consistently demonstrates a significant bias score, distinguishing between targeted and non-targeted groups across various datasets and model architectures.

13 October 2024
Verified
Conference Paper
Open access
AYArdhi Wiratama Baskara Yudha
Ardhi Wiratama Baskara Yudha
JXJiaqi Xue
Jiaqi Xue
QLQian Lou
Qian Lou
HZHuiyang Zhou
Huiyang Zhou
YSYan Solihin
Yan Solihin
Fully Homomorphic Encryption (FHE) allows for the execution of computations on encrypted data without the need to decrypt it first, offering significant potential for privacy-preserving computational operations. Emerging arithmetic-based FHE schemes (ar-FHE), like BGV, demonstrate even better performance in word-wise comparison operations over non-arithmetic FHE (na-FHE) schemes, such as TFHE, especially for basic tasks like comparing values, finding maximums, and minimums. This shows the universality of ar-FHE in effectively handling both arithmetic and non-arithmetic operations without the expensive conversion between arithmetic and non-arithmetic FHEs. We refer to universal arithmetic Fully Homomorphic Encryption as uFHE. The arithmetic operations in uFHE remain consistent with those in the original arithmetic FHE, which have seen significant acceleration. However, its non-arithmetic comparison operations differ, are slow, and have not been as thoroughly studied or accelerated. In this paper, we introduce BoostCom, a scheme designed to speed up word-wise comparison operations, enhancing the efficiency of uFHE systems. BoostCom involves a multi-prong optimizations including infrastructure acceleration (Multi-level heterogeneous parallelization and GPU-related improvements), and algorithm-aware optimizations (slot compaction, non-blocking comparison semantic). Together, BoostCom achieves an end-to-end performance improvement of more than an order of magnitude (11.1 × faster) compared to the state-of-the-art CPU-based uFHE systems, across various FHE parameters and tasks.

19 November 2023
Verified
Conference Paper
Open access
JXJiaqi Xue
Jiaqi Xue
YZYancheng Zhang
Yancheng Zhang
YWYanshan Wang
Yanshan Wang
XWXueqiang Wang
Xueqiang Wang
HZHao Zheng
Hao Zheng
QLQian Lou
Qian Lou
Secure training, while protecting the confidentiality of both data and model weights, typically incurs significant training overhead. Traditional Fully Homomorphic Encryption (FHE)-based non-inter-active training models are heavily burdened by computationally demanding bootstrapping. To develop an efficient secure training system, we established a foundational framework, CryptoTrain-B, utilizing a hybrid cryptographic protocol that merges FHE with Oblivious Transfer (OT) for handling linear and non-linear operations, respectively. This integration eliminates the need for costly bootstrapping. Although CryptoTrain-B sets a new baseline in performance, reducing its training overhead remains essential. We found that ciphertext-ciphertext multiplication (CCMul) is a critical bottleneck in operations involving encrypted inputs and models. Our solution, the CCMul-Precompute technique, involves precomputing CCMul offline and resorting to the less resource-intensive ciphertext-plaintext multiplication (CPMul) during private training. Furthermore, conventional polynomial convolution in FHE systems tends to encode irrelevant and redundant values into polynomial slots, necessitating additional polynomials and ciphertexts for input representation and leading to extra multiplications. Addressing this, we introduce correlated polynomial convolution, which encodes only related input values into polynomials, thus drastically reducing the number of computations and overheads. By integrating CCMul-Precompute and correlated polynomial convolution into CryptoTrain-B, we facilitate a rapid and efficient secure training framework, CryptoTrain. Extensive experiments demonstrate that CryptoTrain achieves a ~5.3× training time reduction compared to prior methods.

26 July 2026
Verified
Conference Paper
Open access
AKAhasan Kabir
Ahasan Kabir
JXJiaqi Xue
Jiaqi Xue
MZMengxin Zheng
Mengxin Zheng
QLQian Lou
Qian Lou