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

Wanru Lu

dblp:418/5862 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 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.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning
asynchronous federated learning
1.012026
Efficient Adaptive Asynchronous Federated Learning Based on Differential Privacy · IEEE Trans. Dependable Secur. Comput. 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
Efficient Adaptive Asynchronous Federated Learning Based on Differential Privacy · IEEE Trans. Dependable Secur. Comput. 2026
Privacy and data protection
differential privacy
1.012026
Efficient Adaptive Asynchronous Federated Learning Based on Differential Privacy · IEEE Trans. Dependable Secur. Comput. 2026
Privacy and data protection › privacy analysis › privacy models
user-level differential privacy
1.012026
Efficient Adaptive Asynchronous Federated Learning Based on Differential Privacy · IEEE Trans. Dependable Secur. Comput. 2026

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

gaussian noise · 2.0dual-event triggering · 2.0delay-adaptive aggregation · 2.0
YearPublicationVenuePosition
2026 Blockchain-based multi-user dynamic verifiable searchable encryption for secure data storage and query on malicious cloud server
Wanru Lu, Lingwen Kong, Guanhua Chen 0007, Jian Weng 0001
J. Syst. Archit.2
2026 Efficient Adaptive Asynchronous Federated Learning Based on Differential Privacy
abstract
Asynchronous Federated Learning (AFL) is an efficient and secure distributed machine learning paradigm designed to tackle challenges such as data silos and client heterogeneity. However, practical implementations often suffer from sporadic client participation due to suboptimal network conditions or varying device quality, resulting in significant latency for model updates. Additionally, data privacy is also a security issue that cannot be overlooked in Federated Learning. Nevertheless, existing adaptive federated optimization algorithms fall short in effectively addressing the dual challenges of high client-side latency and robust privacy protection. To address these challenges, we propose DPAAFL, an adaptive asynchronous federated learning framework with per-client differential privacy. DPAAFL improves the accuracy–efficiency trade-off by adopting a dual-event triggering rule that admits only sufficiently informative updates with acceptable latency, and by mitigating the impact of staleness through delay-adaptive aggregation; meanwhile, a buffered asynchronous update scheme reduces the communication overhead by aggregating updates in batches. In addition, each client perturbs its clipped update with calibrated Gaussian noise before transmission, providing differential privacy protection against privacy inference attacks under the honest-but-curious threat model. We provide theoretical analyses for both convergence and privacy. Extensive experiments demonstrate that the proposed scheme not only reduces the communication overhead and enhances system robustness, but also significantly improves the training efficiency and ensures the accuracy of the model. In comparison with contemporary state-of-the-art algorithms, the proposed scheme improves model accuracy and training efficiency by up to 3.5% and 29.3%, respectively.
Wanru Lu, Zhonghao Zhai, Jian Weng 0001
IEEE Trans. Dependable Secur. Comput.3