CoChat

Byzantine-Resilient Secure Federated Learning

Open access
So, Jinhyun, Guler, Basak, Avestimehr, A. Salman · 2021 · IEEE Journal on Selected Areas in Communications

The DOI matches its Crossref record; 47 of the 48 references it cites were found in a registry or an index.

Abstract

Secure federated learning is a privacy-preserving framework to improve machine learning models by training over large volumes of data collected by mobile users. This is achieved through an iterative process where, at each iteration, users update a global model using their local datasets. Each user then masks its local update via random keys, and the masked models are aggregated at a central server to compute the global model for the next iteration. As the local updates are protected by random masks, the server cannot observe their true values. This presents a major challenge for the resilience of the model against adversarial (Byzantine) users, who can manipulate the global model by modifying their local updates or datasets. Towards addressing this challenge, this paper presents the first single-server Byzantine-resilient secure aggregation framework (BREA) for secure federated learning. BREA is based on an integrated stochastic quantization, verifiable outlier detection, and secure model aggregation approach to guarantee Byzantine-resilience, privacy, and convergence simultaneously. We provide theoretical convergence and privacy guarantees and characterize the fundamental trade-offs in terms of the network size, user dropouts, and privacy protection. Our experiments demonstrate convergence in the presence of Byzantine users, and comparable accuracy to conventional federated learning benchmarks.

Overview

Integrity signals

Registry

Crossref · 10.1109/jsac.2020.3041404

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 47 references

Research works printed but not linked: 3

  1. bottou, 1998, Online learning and stochastic approximations, Online Learning in Neural Networks, 17, 142
  2. mcmahan, 2017, Communication-efficient learning of deep networks from decentralized data, Proc 20th Int Conf Artif Intell Statist, 54, 1273
  3. lecun, 2010, MNIST Handwritten Digit Database

Cited by

See all 316

Metadata

Authors
So, J., Guler, B., & Avestimehr, A. S.
Affiliations
University of Southern California (US)
Venue
IEEE Journal on Selected Areas in Communications
Published
2021-07
Volume
39
Issue
7
Pages
2168-2181
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W3107632872
Cited by
313
References
48
Citations by year
2026: 32 · 2025: 81 · 2024: 67 · 2023: 55 · 2022: 43 · 2021: 27
FWCI
13.06
Type
journal article
Language
en
Open access
Locations
  • IEEE Journal on Selected Areas in Communications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Defense Advanced Research Projects Agency (HR001117C0053)
  • Army Research Office (W911NF1810400)
  • NSF (CCF-1703575, CCF-1763673)
  • Office of Naval Research (N00014-16-1-2189)
  • research gifts from Intel and Facebook
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
Keywords
secure federated learning, Byzantine resilience, secure aggregation, stochastic quantization, privacy preservation, convergence guarantees, user dropout

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Byzantine-Resilient Secure Federated Learning. https://app.cochat.ai/papers/10.1109/jsac.2020.3041404
The paper
So, J., Guler, B., & Avestimehr, A. S. (2021). Byzantine-Resilient Secure Federated Learning. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2020.3041404

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.