Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 314

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

VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning

Open access
Guo, Xiaojie, Liu, Zheli, Li, Jin, Gao, Jiqiang, Hou, Boyu, Dong, Changyu, Baker, Thar·2021·IEEE Transactions on Information Forensics and Security

Abstract

Federated learning (FL) enables a large number of clients to collaboratively train a global model through sharing their gradients in each synchronized epoch of local training. However, a centralized server used to aggregate these gradients can be compromised and forge the result in order to violate privacy or launch other attacks, which incurs the need to verify the integrity of aggregation. In this work, we explore how to design communication-efficient and fast verifiable aggregation in FL. We propose VeriFL, a verifiable aggregation protocol, with O(N) (dimension-independent) communication and O(N+ d) computation for verification in each epoch, where N is the number of clients and d is the dimension of gradient vectors. Since d can be large in some real-world FL applications (e.g., 100K), our dimension-independent communication is especially desirable for clients with limited bandwidth and high-dimensional gradients. In addition, the proposed protocol can be used in the FL setting where secure aggregation is needed or there is a subset of clients dropping out of protocol execution. Experimental results indicate that our protocol is efficient in these settings.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tifs.2020.3043139

Cites

55 of 55 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 55 references

Cited by

See all 314

Metadata

Authors
Guo, X., Liu, Z., Li, J., Gao, J., Hou, B., Dong, C., & Baker, T.
Venue
IEEE Transactions on Information Forensics and Security
Published
2021
Volume
16
Pages
1736-1751
ISSN
  • 1556-6013 (ISSN-L)
  • 1556-6021
OpenAlex
W3110845456
Cited by
314
References
55
FWCI
9.76
Type
journal article
Language
en
Open access
green

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: VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning. https://app.cochat.ai/papers/10.1109/tifs.2020.3043139
The paper
Guo, X., Liu, Z., Li, J., Gao, J., Hou, B., Dong, C., & Baker, T. (2021). VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2020.3043139

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.