Jing Wen
Jing Wen has a total of 6 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
1 shared publication - Fang Liu
School of Mathematics and Information Science, Institute of Data Science and Intelligent Decision Making, Guangxi University, Nanning, Guangxi, China
1 shared publication - Fanqi Kong
School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
1 shared publication - Ji-Ting Mo
School of Mathematics, Guangxi University, Nanning, China
1 shared publication - Shaoling Liang
Guangxi Zhuang Autonomous Region Information Center, Nanning 530000, China, China
1 shared publication - Yongheng Li
School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
1 shared publication
Latest Publications
- 27 February 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (5) , 3325-3342
A PCC-based consensus reaching model in group decision making with non-reciprocal pairwise comparison matrices
- 27 February 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (5) , 3325-3342
A PCC-based consensus reaching model in group decision making with non-reciprocal pairwise comparison matrices
- 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.