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

Simon Lachnit

dblp:417/4097 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0009-8566-3842ORCID · reported

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

Security and privacy · 2 · 1 first-author · 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
Security and privacy of machine learning · 76% Privacy and data protection · 24%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › adversarial attack
physical adversarial attack
1.012026
Targeted Physical Evasion Attacks in the Near-Infrared Domain · NDSS 2026
Security and privacy of machine learning › adversarial attack
backdoor attack
0.912025
On Hyperparameters and Backdoor-Resistance in Horizontal Federated Learning · CCS 2025
Security and privacy of machine learning
federated learning security
0.912025
On Hyperparameters and Backdoor-Resistance in Horizontal Federated Learning · CCS 2025
Privacy and data protection › differential privacy
hyperparameter tuning
0.912025
On Hyperparameters and Backdoor-Resistance in Horizontal Federated Learning · CCS 2025
Machine learning › Efficient and distributed learning
federated learning
0.312025
On Hyperparameters and Backdoor-Resistance in Horizontal Federated Learning · CCS 2025
Machine learning › Efficient and distributed learning › federated learning › federated learning architecture
horizontal federated learning
0.312025
On Hyperparameters and Backdoor-Resistance in Horizontal Federated Learning · CCS 2025

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

backdoor defense · 1.7backdoor attack · 1.7adversarial patch · 1.0
YearPublicationVenuePosition
2026 Targeted Physical Evasion Attacks in the Near-Infrared Domain
Pascal Zimmer, Simon Lachnit, Alexander Jan Zielinski, Ghassan Karame
NDSS2
2025 On Hyperparameters and Backdoor-Resistance in Horizontal Federated Learning
abstract
Horizontal Federated Learning (HFL) is particularly vulnerable to backdoor attacks as adversaries can easily manipulate both the training data and processes to execute sophisticated attacks. In this work, we study the impact of training hyperparameters on the effectiveness of backdoor attacks and defenses in HFL. More specifically, we show both analytically and by means of measurements that the choice of hyperparameters by benign clients does not only influence model accuracy but also significantly impacts backdoor attack success. This stands in sharp contrast with the multitude of contributions in the area of HFL security, which often rely on custom ad-hoc hyperparameter choices for benign clients---leading to more pronounced backdoor attack strength and diminished impact of defenses. Our results indicate that properly tuning benign clients' hyperparameters---such as learning rate, batch size, and number of local epochs---can significantly curb the effectiveness of backdoor attacks, regardless of the malicious clients' settings. We support this claim with an extensive robustness evaluation of state-of-the-art attack-defense combinations, showing that carefully chosen hyperparameters yield across-the-board improvements in robustness without sacrificing main task accuracy. For example, we show that the 50%-lifespan of the strong A3FL attack can be reduced by 98.6%, respectively---all without using any defense and while incurring only a 2.9 percentage points drop in clean task accuracy.
Simon Lachnit, Ghassan Karame
CCS1