Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuxuan Xiao 0001

dblp:254/8209-1 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0000-9496-5978ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 62% Cryptographic primitives and cryptanalysis · 38%
Artificial intelligence
2 papers
Efficient and distributed learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving machine learning
federated learning privacy
1.822026
Octopus: A Robust and Privacy-Preserving Scheme for Compressed Gradients in Federated Learning · IEEE Trans. Dependable Secur. Comput. 2026
SecFed: A Secure and Efficient Federated Learning Based on Multi-Key Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2024
Machine learning › Efficient and distributed learning
federated learning
1.222026
Octopus: A Robust and Privacy-Preserving Scheme for Compressed Gradients in Federated Learning · IEEE Trans. Dependable Secur. Comput. 2026
SecFed: A Secure and Efficient Federated Learning Based on Multi-Key Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2024
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.812024
SecFed: A Secure and Efficient Federated Learning Based on Multi-Key Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2024
Cryptographic primitives and cryptanalysis › homomorphic encryption
multi-key homomorphic encryption
0.812024
SecFed: A Secure and Efficient Federated Learning Based on Multi-Key Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2024
Privacy and data protection
privacy-preserving machine learning
0.812024
SecFed: A Secure and Efficient Federated Learning Based on Multi-Key Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2024

Methods — techniques the papers use, named apart from their topics

masking · 2.0gradient compression · 2.0trusted execution environment · 1.5multi-key homomorphic encryption · 1.5sketches · 1.0sketch · 1.0
YearPublicationVenuePosition
2026 Octopus: A Robust and Privacy-Preserving Scheme for Compressed Gradients in Federated Learning
abstract
Federated learning is a distributed machine learning framework that allows multiple parties to collaboratively train a shared model without the need to share their original data with a central server. This approach minimizes the risk of data leakage and effectively addresses the challenge of isolated data silos. However, it necessitates multiple rounds of interactions to transmit models or gradients between the client and the server, leading to a significant communication cost and private data leakage. Consequently, some schemes compress the transmitted models or gradients through model pruning or knowledge distillation. However, they often overlook the privacy implications of compressed gradients or models, potentially resulting in privacy breaches. Additionally, they are susceptible to client disconnections, resulting in incomplete or delayed model updates. To address these challenges, this paper proposes Octopus, a robust and privacy-preserving scheme for compressed gradients in federated learning. Octopus employs Sketch to compress gradients and embeds masks for the compressed gradients, thereby safeguarding the gradients while concurrently reducing communication overhead. Moreover, we propose an anti-disconnection strategy to support model updates even in situations where some clients are disconnected. Lastly, we carry out comprehensive security and convergence analyses, along with extensive performance evaluations, demonstrating Octopus's robustness, stability, and efficiency over existing schemes.
Wenxiu Ding, Yuxuan Xiao 0001, Zheng Yan 0002, Ciwei Chen, Xuyang Jing
IEEE Trans. Dependable Secur. Comput.2
2024 SecFed: A Secure and Efficient Federated Learning Based on Multi-Key Homomorphic Encryption
abstract
Federated Learning (FL) is widely used in various industries because it effectively addresses the predicament of isolated data island. However, eavesdroppers is capable of inferring user privacy from the gradients or models transmitted in FL. Homomorphic Encryption (HE) can be applied in FL to protect sensitive data owing to its computability over ciphertexts. However, traditional HE as a single-key system cannot prevent dishonest users from intercepting and decrypting the ciphertexts from cooperative users in FL. Guaranteeing privacy and efficiency in this multi-user scenario is still a challenging target. In this paper, we propose a secure and efficient Federated Learning scheme (SecFed) based on multi-key HE to preserve user privacy and delegate some operations to TEE to improve efficiency while ensuring security. Specifically, we design the first TEE-based multi-key HE cryptosystem (EMK-BFV) to support privacy-preserving FL and optimize operation efficiency. Furthermore, we provide an offline protection mechanism to ensure the normal operation of system with disconnected participants. Finally, we give their security proofs and show their efficiency and superiority through comprehensive simulations and comparisons with existing schemes. SecFed offers a 3x performance improvement over TEE-based scheme and a 2x performance improvement over HE-based solution.
Wenxiu Ding, Yuxuan Xiao 0001, Zheng Yan 0002, Ximeng Liu, Zhiguo Wan
IEEE Trans. Dependable Secur. Comput.3