Yongheng Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yongheng Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Baohua Huang
School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
3 shared publications - Fanqi Kong
School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
3 shared publications - Jing Wen
Guangxi Key Laboratory of Digital Infrastructure, Guangxi Zhuang Autonomous Region Information Center, Nanning 530000, China
2 shared publications - Shaoling Liang
Guangxi Key Laboratory of Digital Infrastructure, Guangxi Zhuang Autonomous Region Information Center, Nanning 530000, China
2 shared publications - Jing Wen
Guangxi Key Laboratory of Digital Infrastructure, Guangxi Zhuang Autonomous Region Information Center, Nanning, China
1 shared publication - Shaoling Liang
Guangxi Zhuang Autonomous Region Information Center, Nanning 530000, China, China
1 shared publication
Latest Publications
- 3 June 2026
- Published by Springer Nature
- p. 137-150
An Acceleration Framework for Privacy-Preserving Neural Network Inference Using Fully Homomorphic Encryption
- 3 June 2026
- Published by Springer Nature
- p. 137-150
An Acceleration Framework for Privacy-Preserving Neural Network Inference Using Fully Homomorphic Encryption
- Open Access
- 25 February 2026
- Published by MDPI AG in Electronics
- Vol. 15 (5) , 940
Multi-Group Fully Homomorphic Encryption Scheme Based on LWE and NTRU
Multi-group homomorphic encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of multi-party homomorphic encryption (MPHE) and multi-key homomorphic encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing was adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. A new multi-group ciphertext bootstrapping algorithm for MGHE was developed via the integration of LWE and NTRU cryptographic primitives. Bootstrapping tasks were decomposed for parallel processing, and a hybrid product algorithm was designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation was analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments showed that 30- and 50-party multi-group bootstrapping takes only 1.87 s and 2.58 s respectively.
- 25 February 2026
- Published by MDPI AG in Electronics
- Vol. 15 (5) , 940
Open AccessMulti-Group Fully Homomorphic Encryption Scheme Based on LWE and NTRU
Multi-group homomorphic encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of multi-party homomorphic encryption (MPHE) and multi-key homomorphic encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing was adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. A new multi-group ciphertext bootstrapping algorithm for MGHE was developed via the integration of LWE and NTRU cryptographic primitives. Bootstrapping tasks were decomposed for parallel processing, and a hybrid product algorithm was designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation was analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments showed that 30- and 50-party multi-group bootstrapping takes only 1.87 s and 2.58 s respectively.
- Open Access
- 8 January 2026
- Published by MDPI AG in Preprints.org
Multi-Group Fully Homomorphic Encryption Scheme Based on LWE and NTRU
Multi-Group Homomorphic Encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of Multi-Party Homomorphic Encryption (MPHE) and Multi-Key Homomorphic Encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios, due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing is adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. For the first time, a multi-group ciphertext bootstrapping algorithm based on LWE and NTRU is proposed. Bootstrapping tasks are decomposed for parallel processing, and a hybrid product algorithm is designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation is analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments show that 30/50-party multi-group bootstrapping takes only 1.87/2.58 seconds respectively.
- 8 January 2026
- Published by MDPI AG in Preprints.org
Open AccessMulti-Group Fully Homomorphic Encryption Scheme Based on LWE and NTRU
Multi-Group Homomorphic Encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of Multi-Party Homomorphic Encryption (MPHE) and Multi-Key Homomorphic Encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios, due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing is adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. For the first time, a multi-group ciphertext bootstrapping algorithm based on LWE and NTRU is proposed. Bootstrapping tasks are decomposed for parallel processing, and a hybrid product algorithm is designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation is analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments show that 30/50-party multi-group bootstrapping takes only 1.87/2.58 seconds respectively.