Rui Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rui Xu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Kirill Morozov
University of North Texas
1 shared publication - Partha Sarathi Roy
University of Wollongong
1 shared publication - Rainer Steinwandt
Florida Atlantic University
1 shared publication - Xiaoyuan Qin
School of Computer Science, China University of Geosciences, Wuhan 430078, China
1 shared publication
Latest Publications
- Open Access
- 25 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (9) , 1404
Efficient Post-Quantum Cross-Silo Federated Learning Based on Key Homomorphic Pseudo-Random Function
Federated Learning (FL) enables collaborative model training across distributed users, while preserving data privacy by only sharing model updates. However, secure aggregation, which is essential to prevent data leakage during this process, often incurs significant communication and computational costs. Moreover, existing schemes rarely consider whether they can resist quantum attacks. To address these challenges, we propose an efficient, post-quantum aggregation protocol based on a Key Homomorphic Pseudo-Random Function (KHPRF). Our non-interactive mask elimination mechanism reduces aggregation to a single round, significantly minimizing the communication overhead. Furthermore, the KHPRF keys are reusable, enabling multiple aggregations with a one-time initialization, thereby enhancing efficiency in cross-silo federated learning. Compared to existing schemes, our approach achieves quantum-resistant aggregation with improved efficiency.
- 25 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (9) , 1404
Open AccessEfficient Post-Quantum Cross-Silo Federated Learning Based on Key Homomorphic Pseudo-Random Function
Federated Learning (FL) enables collaborative model training across distributed users, while preserving data privacy by only sharing model updates. However, secure aggregation, which is essential to prevent data leakage during this process, often incurs significant communication and computational costs. Moreover, existing schemes rarely consider whether they can resist quantum attacks. To address these challenges, we propose an efficient, post-quantum aggregation protocol based on a Key Homomorphic Pseudo-Random Function (KHPRF). Our non-interactive mask elimination mechanism reduces aggregation to a single round, significantly minimizing the communication overhead. Furthermore, the KHPRF keys are reusable, enabling multiple aggregations with a one-time initialization, thereby enhancing efficiency in cross-silo federated learning. Compared to existing schemes, our approach achieves quantum-resistant aggregation with improved efficiency.
- Open Access
- 1 January 2018
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 16 (1) , 161-167
On the security of the Courtois-Finiasz-Sendrier signature
We prove that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the Niederreiter problem). In addition, we explicitly show that security against key substitution attacks can be arranged by a standard technique of Menezes and Smart, hashing the public key.
- 1 January 2018
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 16 (1) , 161-167
Open AccessOn the security of the Courtois-Finiasz-Sendrier signature
We prove that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the Niederreiter problem). In addition, we explicitly show that security against key substitution attacks can be arranged by a standard technique of Menezes and Smart, hashing the public key.