Demo Data from EDBT 2026 / reviewers in the wild / expert
Boan Yu
dblp:399/3448
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0005-8001-4844ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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
1 paper |
Privacy and data protection · 50% Cryptographic primitives and cryptanalysis · 50% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › functional encryption
decentralized multi-client functional encryption |
0.9 | 1 | 2025 | Lightweight and Dynamic Privacy-Preserving Federated Learning via Functional Encryption · IEEE Trans. Inf. Forensics Secur. 2025 |
Privacy and data protection › privacy-preserving machine learning
federated learning privacy |
0.9 | 1 | 2025 | Lightweight and Dynamic Privacy-Preserving Federated Learning via Functional Encryption · IEEE Trans. Inf. Forensics Secur. 2025 |
Cryptographic primitives and cryptanalysis
functional encryption |
0.9 | 1 | 2025 | Lightweight and Dynamic Privacy-Preserving Federated Learning via Functional Encryption · IEEE Trans. Inf. Forensics Secur. 2025 |
Privacy and data protection
privacy-preserving machine learning |
0.9 | 1 | 2025 | Lightweight and Dynamic Privacy-Preserving Federated Learning via Functional Encryption · IEEE Trans. Inf. Forensics Secur. 2025 |
Machine learning › Efficient and distributed learning
federated learning |
0.3 | 1 | 2025 | Lightweight and Dynamic Privacy-Preserving Federated Learning via Functional Encryption · IEEE Trans. Inf. Forensics Secur. 2025 |
Methods — techniques the papers use, named apart from their topics
vector compression · 1.7functional encryption · 1.7chinese remainder theorem · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Lightweight and Dynamic Privacy-Preserving Federated Learning via Functional EncryptionabstractFederated Learning (FL) is a distributed machine learning framework that allows multiple clients to collaboratively train an intermediate model with keeping data local, however, sensitive information may be still inferred during exchanging local models. Although homomorphic encryption and multi-party computation are applied into FL solutions to mitigate such privacy risks, they lead to costly communication overhead and long training time. As a result, functional encryption (FE) is introduced into the field of privacy-preserving FL (PPFL) for boosting efficiency and enhancing security. Nevertheless, existing FE-based PPFL frameworks that support dynamic participation either required a trusted third party that may lead to single-point failure, or require multiple rounds of interaction that inevitably incur large communication overhead. Therefore, we propose PrivLDFL, a lightweight and dynamic PPFL framework for resource-constrained devices. Technically, we formalize dynamic decentralized multi-client FE and give instantiations, then present efficiency optimizations via designing a vector compression funnel based on Chinese Remainder Theorem, and finally achieve client dropouts via a client partitioning strategy. Besides formal security analysis on PrivLDFL, we implement it and state-of-the-art solutions on Raspberry Pi to conduct extensive experiments, confirming the practical performance of PrivLDFL on best-known public datasets. Boan Yu, Kai Zhang 0016, Junqing Gong 0001, Haifeng Qian |
IEEE Trans. Inf. Forensics Secur. | 1 |