Cited by 54Privacy-Preserving Technologies in DataAdversarial Robustness in Machine LearningCryptography and Data Security

SAFELearning: Secure Aggregation in Federated Learning With Backdoor Detectability

Open access
Zhang, Zhuosheng, Li, Jiarui, Yu, Shucheng, Makaya, Christian·2023·IEEE Transactions on Information Forensics and Security

Abstract

For model privacy, local model parameters in federated learning shall be obfuscated before sent to the remote aggregator. This technique is referred to assecure aggregation. However, secure aggregation makes model poisoning attacks such as backdooring more convenient given that existing anomaly detection methods mostly require access to plaintext local models. This paper proposes a new federated learning technique SAFE-Learning to support backdoor detection for secure aggregation. We achieve this through two new primitives -oblivious random grouping (ORG)andpartial parameter disclosure (PPD). ORG partitions participants into one-time random subgroups with group configurations oblivious to participants; PPD allows secure partial disclosure of aggregated subgroup models for anomaly detection without leaking individual model privacy. ORG is based on our construction of several new primitives including tree-based random subgroup generation, oblivious secure aggregation, and randomized Diffie-Hellman key exchange. ORG can thwart colluding attackers from knowing each other’s group membership assignment with non-negligible advantage than random guess. Backdoor attacks are detected based on statistical distributions of the subgroup aggregated parameters of the learning iterations. SAFELearning can significantly reduce backdoor model accuracy without jeopardizing the main task accuracy under common backdoor strategies. Extensive experiments show SAFELearning is robust against malicious and faulty participants, whilst being more efficient than the state-of-art secure aggregation protocol in terms of both communication and computation costs.

Integrity signals

Registry

Crossref · 10.1109/tifs.2023.3280032

Cites

7 of 7 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?

  • Zhang's design scheme has better performance in terms of communication and computational cost compared to Nuria's robust filtering operator, but Nuria focuses more on detection of outlier behaviors of adversarial participants.

    “Compared to the robust filtering operator for one-dimensional outliers proposed by Nuria.Zhang's design scheme has better performance in terms of communication and computational cost, but Nuria focuses more on the detection of outlier behaviors of adversarial participants, with a focus on defending against model-poisoning attacks based on data poisoning and”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhang, Z., Li, J., Yu, S., & Makaya, C.
Affiliations
Stevens Institute of Technology (US)
Venue
IEEE Transactions on Information Forensics and Security
Published
2023
Volume
18
Pages
3289-3304
ISSN
  • 1556-6013 (ISSN-L)
  • 1556-6021
OpenAlex
W4378195077
Cited by
54
References
7
Citations by year
2026: 16 · 2025: 17 · 2024: 15 · 2023: 3 · 2022: 2 · 2021: 1
FWCI
4.51
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Information Forensics and Security (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
NSF (ECCS#1923739)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
Keywords
secure aggregation, federated learning, backdoor detection, backdoor attacks, model poisoning, model privacy, anomaly detection, safe learning

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