MétaCan
Menu
Back to cohort
Record W4413332413 · doi:10.1016/j.procs.2025.07.186

Defending federated learning systems against untargeted sybil attacks in non-IID environments

2025· article· en· W4413332413 on OpenAlexaff
Ali Abduelmula, Ziad Kobti

Bibliographic record

VenueProcedia Computer Science · 2025
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer scienceSybil attackComputer securityArtificial intelligenceComputer networkWireless sensor network

Abstract

fetched live from OpenAlex

Federated Learning systems are vulnerable to Sybil attacks, where malicious clients inject multiple fake identities to corrupt the learning process. We propose mitigating untargeted Sybil attacks using a robust aggregation method that integrates FoolsGold with Sinkhorn-enhanced Earth Mover’s Distance (EMD) and a multi-step trust-weighting strategy. FoolsGold assigns trust scores based on client update similarity, while Sinkhorn-enhanced EMD refines Sybil detection by computing transport distances between gradient distributions. These scores are dynamically adjusted using a performance-aware mechanism, incorporating clients’ reported distributed accuracy to penalize unreliable updates. Additionally, mild adaptive trimming filters out the lowest 10% of trust scores, reducing adversarial influence while preserving valuable client contributions. These enhancements make the proposed method resilient to Sybil attacks while ensuring efficient model convergence in non-IID (non-independent and identically distributed) data settings. Empirical evaluations demonstrate that our approach outperforms FoolsGold, reducing false positives and improving model robustness.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.014
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0020.004
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.001

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.007
GPT teacher head0.233
Teacher spread0.225 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations1
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueProcedia Computer ScienceSame topicCryptography and Data SecurityFrench-language works237,207