Pith. sign in

REVIEW 2 cited by

Krum Federated Chain (KFC): Using blockchain to defend against adversarial attacks in Federated Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.06917 v1 pith:PR5P2EUY submitted 2025-02-10 cs.LG cs.AI

classification cs.LGcs.AI
keywords federatedlearningattacksadversarialblockchainkrumbackdoorbyzantine
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated Learning presents a nascent approach to machine learning, enabling collaborative model training across decentralized devices while safeguarding data privacy. However, its distributed nature renders it susceptible to adversarial attacks. Integrating blockchain technology with Federated Learning offers a promising avenue to enhance security and integrity. In this paper, we tackle the potential of blockchain in defending Federated Learning against adversarial attacks. First, we test Proof of Federated Learning, a well known consensus mechanism designed ad-hoc to federated contexts, as a defense mechanism demonstrating its efficacy against Byzantine and backdoor attacks when at least one miner remains uncompromised. Second, we propose Krum Federated Chain, a novel defense strategy combining Krum and Proof of Federated Learning, valid to defend against any configuration of Byzantine or backdoor attacks, even when all miners are compromised. Our experiments conducted on image classification datasets validate the effectiveness of our proposed approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Byzantine Accountability Without Consensus: Strong Eventual Consistency for Non-Associative, Stochastic, Robust Aggregation

    cs.DC 2026-07 conditional novelty 6.0 of 10

    Any pure function of a product of CRDTs inherits Strong Eventual Consistency, so multi-Krum and similar discontinuous robust selectors can be made coordinator-free and accountable via OR-Set contributions plus grow-on...

  2. Secure and Private Federated Learning: Achieving Adversarial Resilience through Robust Aggregation

    cs.LG 2025-05 conditional novelty 4.0 of 10

    ArKrum combines median-based outlier filtering with multi-update averaging to make Krum-style federated aggregation parameter-free and more stable, matching or beating Krum and mKrum on benchmark attacks, but failing ...

Pith tools