Cited by 303Privacy-Preserving Technologies in DataBlockchain Technology Applications and SecurityCryptography and Data Security

Privacy-Preserving Byzantine-Robust Federated Learning via Blockchain Systems

Open access
Miao, Yinbin, Liu, Ziteng, Li, Hongwei, Choo, Kim-Kwang Raymond, Deng, Robert H.·2022·IEEE Transactions on Information Forensics and Security

Abstract

Federated learning enables clients to train a machine learning model jointly without sharing their local data. However, due to the centrality of federated learning framework and the untrustworthiness of clients, traditional federated learning solutions are vulnerable to poisoning attacks from malicious clients and servers. In this paper, we aim to mitigate the impact of the central server and malicious clients by designing a Privacy-preserving Byzantine-robust Federated Learning (PBFL) scheme based on blockchain. Specifically, we use cosine similarity to judge the malicious gradients uploaded by malicious clients. Then, we adopt fully homomorphic encryption to provide secure aggregation. Finally, we use blockchain system to facilitate transparent processes and implementation of regulations. Our formal analysis proves that our scheme achieves convergence and provides privacy protection. Our extensive experiments on different datasets demonstrate that our scheme is robust and efficient. Even if the root dataset is small, our scheme can achieve the same efficiency as FedSGD.

Integrity signals

Registry

Crossref · 10.1109/tifs.2022.3196274

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

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

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?

  • Use of secure robust aggregation is currently recognized as an effective means for defending against Byzantine attacks.

    “The use of secure robust aggregation is currently recognized as an effective means for defending against Byzantine attacks (Li et al. 2023d;Miao et al. 2022;Wan et al. 2022).”

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. 10.1109/MNET.011.2000263 · DOI · Paper page

Cited by

Sorted by citations

Authors
Miao, Y., Liu, Z., Li, H., Choo, K.-K. R., & Deng, R. H.
Affiliations
  • Xidian University (CN)
  • University of Electronic Science and Technology of China (CN)
  • The University of Texas at San Antonio (US)
  • Singapore Management University (SG)
Venue
IEEE Transactions on Information Forensics and Security
Published
2022
Volume
17
Pages
2848-2861
ISSN
  • 1556-6013 (ISSN-L)
  • 1556-6021
OpenAlex
W4289656845
Cited by
303
References
41
Citations by year
2026: 57 · 2025: 101 · 2024: 97 · 2023: 44 · 2022: 4
FWCI
20.23
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Information Forensics and Security (publishedVersion)
  • Singapore Management University Institutional Knowledge (InK) (Singapore Management University) (submittedVersion, other-oa)
Funders
  • National Natural Science Foundation of China (62072361, 62125205)
  • Key Research and Development Program of Shaanxi (2022GY-019)
  • Fundamental Research Funds for the Central Universities (JB211505)
  • Henan Key Laboratory of Network Cryptography Technology and the State Key Laboratory of Mathematical Engineering and Advanced Computing (LNCT2020-A06)
  • Cloud Technology Endowed Professorship
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
Keywords
federated learning, privacy preservation, Byzantine robustness, blockchain, poisoning attacks, malicious clients, malicious server, cosine similarity, fully homomorphic encryption, secure aggregation, convergence analysis

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