Xianhui LU

Prof. Xianhui LU


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
13 January 2025 in IACR Communications in Cryptology
Verified
Journal Article
Open access
PDF file
JBJean-Philippe Bossuat
Jean-Philippe Bossuat
RCRosario Cammarota
Rosario Cammarota
ICIlaria Chillotti
Ilaria Chillotti
BCBenjamin R. Curtis
Benjamin R. Curtis
WDWei Dai
Wei Dai
DYDonggeon Yhee
Donggeon Yhee
Fully Homomorphic Encryption (FHE) is a cryptographic primitive that allows performing arbitrary operations on encrypted data. Since the conception of the idea in [RAD78], it has been considered a holy grail of cryptography. After the first construction in 2009 [Gen09], it has evolved to become a practical primitive with strong security guarantees. Most modern constructions are based on well-known lattice problems such as Learning With Errors (LWE). Besides its academic appeal, in recent years FHE has also attracted significant attention from industry, thanks to its applicability to a considerable number of real-world use-cases. An upcoming standardization effort by ISO/IEC aims to support the wider adoption of these techniques. However, one of the main challenges that standards bodies, developers, and end users usually encounter is establishing parameters. This is particularly hard in the case of FHE because the parameters are not only related to the security level of the system, but also to the type of operations that the system is able to handle. In this paper we provide examples of parameter sets for LWE targeting particular security levels, that can be used in the context of FHE constructions. We also give examples of complete FHE parameter sets, including the parameters relevant for correctness and performance, alongside those relevant for security. As an additional contribution, we survey the parameter selection support offered in open-source FHE libraries.

8 May 2024
Verified
Book Chapter
Closed access
PDF file
RWRuida Wang
Ruida Wang
YWYundi Wen
Yundi Wen
ZLZhihao Li
Zhihao Li
Xianhui LUXianhui LU
Xianhui LU
BWBenqiang Wei
Benqiang Wei
KWKunpeng Wang
Kunpeng Wang

12 January 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
KLKwok-Yan Lam
Kwok-Yan Lam
Xianhui LUXianhui LU
Xianhui LU
LZLinru Zhang
Linru Zhang
XWXiangning Wang
Xiangning Wang
Huaxiong WangHuaxiong Wang
Huaxiong Wang
SGSi Qi Goh
Si Qi Goh
AI-as-a-Service has emerged as an important trend for supporting the growth of the digital economy. Digital service providers make use of their vast amount of customer data to train AI models (such as image recognition, financial modelling and pandemic modelling etc) and offer them as a service on the cloud. While there are convincing advantages for using such third-party models, the fact that model users are required to upload their data to the cloud is bound to raise serious privacy concerns, especially in the face of increasingly stringent privacy regulations and legislation. To promote the adoption of AI-as-a-Service while addressing privacy issues, we propose a practical approach for constructing privacy-enhanced neural networks by designing an efficient implementation of fully homomorphic encryption. With this approach, an existing neural network can be converted to process FHE-encrypted data and produce encrypted output which are only accessible by the model users, and more importantly, within an operationally acceptable time (e.g. within 1 second for facial recognition in typical border control systems). Experimental results show that in many practical tasks such as facial recognition, text classification and so on, we obtained the state-of-the-art inference accuracy in less than one second on a 16 cores CPU.

1 December 2023
Verified
Book Chapter
Closed access
PDF file
BWBenqiang Wei
Benqiang Wei
RWRuida Wang
Ruida Wang
ZLZhihao Li
Zhihao Li
QLQinju Liu
Qinju Liu
Xianhui LUXianhui LU
Xianhui LU

18 July 2024 in IACR Transactions on Cryptographic Hardware and Embedded Systems
Verified
Journal Article
Open access
PDF file
ZLZhihao Li
Zhihao Li
Xianhui LUXianhui LU
Xianhui LU
ZWZhiwei Wang
Zhiwei Wang
RWRuida Wang
Ruida Wang
YLYing Liu
Ying Liu
RHRui Hou
Rui Hou
Bootstrapping is a critical technique in constructing fully homomorphic encryption (FHE), which serves to refresh the noise in FHE ciphertexts, enabling an arbitrary number of homomorphic operations. Among published results, the TFHE-rs library [Zam22] offers the fastest bootstrapping implementation on CPU platforms by taking advantage of AVX-512 instructions.In this paper, we improve the efficiency of the bootstrapping algorithm based on the NTRU problem. First, we introduce the approximate gadget decomposition method tailored for NTRU ciphertext, reducing the number of NTT operations required for external products. Second, by integrating the approximate decomposition and key unrolling techniques, we improve the performance of CMux-based blind rotation. Third, for the automorphism-based blind rotation method, we present a hybrid window size technique that reduces the number of automorphisms by 34% compared to recent work [XZD+23](in Crypto23).Subsequently, we implement the proposed bootstrapping algorithm on the CPU platform with AVX instructions. Experimental results demonstrate that our method only takes 3.8ms, which achieves a 1.8× speedup compared to the TFHE-rs library. Finally, we propose an efficient FPGA accelerator based on the CMux method, which not only achieves the best performance but also exhibits high throughput advantages. Our accelerator can improve performance by 2x compared to state-of-the-art FPGA implementations (e.g., FPT).

18 July 2024 in IACR Transactions on Cryptographic Hardware and Embedded Systems
Verified
Journal Article
Open access
PDF file
BWBenqiang Wei
Benqiang Wei
Xianhui LUXianhui LU
Xianhui LU
RWRuida Wang
Ruida Wang
KLKun Liu
Kun Liu
ZLZhihao Li
Zhihao Li
KWKunpeng Wang
Kunpeng Wang
Hybrid homomorphic encryption (a.k.a., transciphering) can alleviate the ciphertext size expansion inherent to fully homomorphic encryption by integrating a specific symmetric encryption scheme, which requires selected symmetric encryption scheme that can be efficiently evaluated homomorphically. While there has been a recent surge in the development of FHE-friendly ciphers, concerns have arisen regarding their security. A significant challenge for the transciphering community remains the efficient evaluation of symmetric encryption algorithms that have undergone extensive study and standardization.In this paper, we present an evaluation framework, dubbed Thunderbird, which for the first time presents efficient homomorphic implementations of stream ciphers SNOW 3G and ZUC that are standardized in the 3G Partnership Project (3GPP). Specifically, Thunderbird combines gate bootstrapping mode and leveled evaluation mode of TFHE to cater to various function types within symmetric encryption algorithms. In the gate bootstrapping mode, we propose a variant of the homomorphic full adder that consumes only a single blind rotation, which may be of independent interest. In the leveled evaluation mode, we employ the CMux gate combining with hybrid packing technique to efficiently achieve lookup tables, significantly reducing the need for gate bootstrapping, and adapt the current optimal circuit bootstrapping to expedite the Thunderbird framework. We have implemented the Thunderbird framework in the TFHEpp public library. Experimental results demonstrate that SNOW 3G and ZUC can homomorphically generate a keyword in only 7 seconds and 9.5 seconds, which are 52x and 32x faster than the trivial gate bootstrapping mode, respectively. For the homomorphic evaluation of the AES-128 algorithm using Thunderbird, we achieve a speedup of 1.9x in terms of latency and use less evaluation key compared to the state-of-the-art work.