MétaCan
Menu
Back to cohort
Record W7148458500 · doi:10.1109/wifs66636.2025.00038

Trust-Based Framework for Securing Decentralized Federated Learning against Malicious Clients

2025· article· W7148458500 on OpenAlexafffund
Imen Ben Said, Talal Halabi, Adel Abusitta, Mohammad Zulkernine

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsQueen's UniversityPolytechnique Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsKey (lock)Government (linguistics)Information privacyField (mathematics)Feature (linguistics)Federated learning

Abstract

fetched live from OpenAlex

Decentralized federated learning (DFL) enables collaborative model training across distributed clients without relying on a central server. However, this paradigm is highly vulnerable to poisoning attacks, especially when a large proportion of participating clients behave maliciously. In this paper, we propose a robust defense framework that empowers each client to detect and mitigate the influence of malicious peers. Our approach combines local gradient-based anomaly detection using DBSCAN with an uncertainty-aware trust aggregation mechanism grounded in Dempster–Shafer theory. This enables clients to assign trust scores to their neighbors and dynamically perform trust-weighted model aggregation, integrating only reliable updates. Our experiments on two standard benchmark datasets, NSL-KDD and ToN_IoT, show that our method maintains over 93% and 83% accuracy, respectively, even when 70% of clients are adversarial under coordinated label-flipping attacks. These results highlight the robustness and effectiveness of our framework in highly adversarial DFL environments, demonstrating its ability to maintain reliable performance even when the majority of clients behave maliciously.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.872
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.003
Science and technology studies0.0020.000
Scholarly communication0.0020.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.015
GPT teacher head0.289
Teacher spread0.274 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes2
Has abstractyes

Explore more

Same topicCryptography and Data SecurityFrench-language works237,207