LoByITFL: Low Communication Secure and Private Federated Learning

Yue Xia, Maximilian Egger, Christoph Hofmeister, Rawad Bitar
5/29/2024
cs.ITcs.CRcs.DC

No confident code implementation found for this paper.

Abstract

Privacy of the clients' data and security against Byzantine clients are key challenges in Federated Learning (FL). Existing solutions to joint privacy and security incur sacrifices on the privacy guarantee. We introduce LoByITFL, the first communication-efficient information-theoretically private and secure FL scheme that makes no sacrifices on the privacy guarantees while ensuring security against Byzantine adversaries. The key components are a small and representative dataset available to the federator, a careful modification of the FLTrust algorithm, and the one-time use of a trusted third party during an initialization period. We provide theoretical guarantees on the privacy and Byzantine resilience, as well as experimental results showing the convergence of LoByITFL.

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. Any repos shown below are weak matches — 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{xia2024lobyitfl,
  title  = {LoByITFL: Low Communication Secure and Private Federated Learning},
  author = {Yue Xia and Maximilian Egger and Christoph Hofmeister and Rawad Bitar},
  year   = {2024},
  eprint = {2405.19217},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.19217v2}
}

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/2405.19217.svg)](https://codeofpaper.com/paper/2405.19217)

Discussion