Demo Data from EDBT 2026 / reviewers in the wild / expert
Nan Yan 0001
dblp:94/4465-1
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0006-9728-2391ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 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
3 papers |
Cryptographic primitives and cryptanalysis · 43% Security and privacy of machine learning · 19% Privacy and data protection · 19% | |
| Artificial intelligence
2 papers |
Efficient and distributed learning · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
homomorphic encryption |
1.1 | 2 | 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2025 Efficient and Straggler-Resistant Homomorphic Encryption for Heterogeneous Federated Learning · INFOCOM 2024 |
Machine learning › Efficient and distributed learning › federated learning
client selection |
0.9 | 1 | 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2025 |
Machine learning › Efficient and distributed learning › distributed training
straggler mitigation |
0.9 | 1 | 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2025 |
Security and privacy of machine learning › adversarial attack
backdoor attack |
0.9 | 1 | 2025 | EmbedX: Embedding-Based Cross-Trigger Backdoor Attack Against Large Language Models · USENIX Security Symposium 2025 |
Privacy and data protection › privacy-preserving machine learning
federated learning privacy |
0.9 | 1 | 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2025 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
packed homomorphic encryption |
0.9 | 1 | 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2025 |
Cryptographic protocols and secure computation
secure aggregation |
0.9 | 1 | 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption · IEEE Trans. Dependable Secur. Comput. 2025 |
Machine learning › Efficient and distributed learning
federated learning |
0.8 | 1 | 2024 | Efficient and Straggler-Resistant Homomorphic Encryption for Heterogeneous Federated Learning · INFOCOM 2024 |
Machine learning › Efficient and distributed learning › federated learning
heterogeneous federated learning |
0.8 | 1 | 2024 | Efficient and Straggler-Resistant Homomorphic Encryption for Heterogeneous Federated Learning · INFOCOM 2024 |
Methods — techniques the papers use, named apart from their topics
sparsification · 3.3CKKS · 3.3perturbed sketch · 1.7blinding · 1.7sketching-based client selection · 1.5packed homomorphic encryption · 1.5embedding-based trigger · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | EmbedX: Embedding-Based Cross-Trigger Backdoor Attack Against Large Language Models
Nan Yan 0001, Yuqing Li 0001, Xiong Wang 0006, Jing Chen 0003, Kun He 0008, Bo Li 0001 |
USENIX Security Symposium | 1 |
| 2025 | FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic EncryptionabstractCross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads,packedHE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted byhonest-but-curious clients. Also, it does not consider theheterogeneityamong different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provideobscuredencrypted updates while the server can perform aggregation by accounting forcontributionsof local updates. To mitigate the straggler effect, we devise aperturbed sketch-based selection to cherry-pick representative clients withheterogeneous models and computing capabilitiesin a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve$2.45-6.56\times$training speedup, cut the communication overhead by$1.32-24.85\times$, and reduce straggler effects by$1.89-2.78\times$. Yuqing Li 0001, Nan Yan 0001, Jing Chen 0003, Xiong Wang 0006, Jianan Hong, Kun He 0008, Wei Wang 0030, Bo Li 0001 |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2024 | Efficient and Straggler-Resistant Homomorphic Encryption for Heterogeneous Federated LearningabstractCross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing their private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE does not consider the heterogeneity among different clients, an intrinsic problem in cross-silo FL, often resulting in undermined training efficiency with slow convergence and stragglers. In this work, we propose FedPHE, an efficiently packed homomorphically encrypted FL framework with secure weighted aggregation and client selection to tackle the heterogeneity problem. Specifically, using CKKS with sparsification, FedPHE can achieve efficient encrypted weighted aggregation by accounting for contributions of local updates to the global model. To mitigate the straggler effect, we devise a sketching-based client selection scheme to cherry-pick representative clients with heterogeneous models and computing capabilities. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients’ privacy, achieve a training speedup of 1.85 − 4.44×, cut the communication overhead by 1.24 − 22.62× , and reduce the straggler effect by up to 1.71 − 2.39×. Nan Yan 0001, Yuqing Li 0001, Jing Chen 0003, Xiong Wang 0006, Jianan Hong, Kun He 0008, Wei Wang 0030 |
INFOCOM | 1 |