TrustChain: A Blockchain Framework for Auditing and Verifying Aggregators in Decentralized Federated Learning

Ehsan Hallaji, Roozbeh Razavi-Far, Mehrdad Saif
2/23/2025
cs.LGcs.AIcs.CR

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

The server-less nature of Decentralized Federated Learning (DFL) requires allocating the aggregation role to specific participants in each federated round. Current DFL architectures ensure the trustworthiness of the aggregator node upon selection. However, most of these studies overlook the possibility that the aggregating node may turn rogue and act maliciously after being nominated. To address this problem, this paper proposes a DFL structure, called TrustChain, that scores the aggregators before selection based on their past behavior and additionally audits them after the aggregation. To do this, the statistical independence between the client updates and the aggregated model is continuously monitored using the Hilbert-Schmidt Independence Criterion (HSIC). The proposed method relies on several principles, including blockchain, anomaly detection, and concept drift analysis. The designed structure is evaluated on several federated datasets and attack scenarios with different numbers of Byzantine nodes.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hallaji2025trustchain,
  title  = {TrustChain: A Blockchain Framework for Auditing and Verifying Aggregators in Decentralized Federated Learning},
  author = {Ehsan Hallaji and Roozbeh Razavi-Far and Mehrdad Saif},
  year   = {2025},
  eprint = {2502.16406},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.16406v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.16406.svg)](https://codeofpaper.com/paper/2502.16406)

Discussion