Cited by 98Privacy-Preserving Technologies in DataRecommender Systems and TechniquesAdversarial Robustness in Machine Learning

PipAttack: Poisoning Federated Recommender Systems for Manipulating Item Promotion

Zhang, Shijie, Yin, Hongzhi, Chen, Tong, Huang, Zi, Nguyen, Quoc Viet Hung, Cui, Lizhen·2022·Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining

Abstract

Due to the growing privacy concerns, decentralization emerges rapidly in personalized services, especially recommendation. Also, recent studies have shown that centralized models are vulnerable to poisoning attacks, compromising their integrity. In the context of recommender systems, a typical goal of such poisoning attacks is to promote the adversary's target items by interfering with the training dataset and/or process. Hence, a common practice is to subsume recommender systems under the decentralized federated learning paradigm, which enables all user devices to collaboratively learn a global recommender while retaining all the sensitive data locally. Without exposing the full knowledge of the recommender and entire dataset to end-users, such federated recommendation is widely regarded 'safe' towards poisoning attacks. In this paper, we present a systematic approach to backdooring federated recommender systems for targeted item promotion. The core tactic is to take advantage of the inherent popularity bias that commonly exists in data-driven recommenders. As popular items are more likely to appear in the recommendation list, our innovatively designed attack model enables the target item to have the characteristics of popular items in the embedding space. Then, by uploading carefully crafted gradients via a small number of malicious users during the model update, we can effectively increase the exposure rate of a target (unpopular) item in the resulted federated recommender. Evaluations on two real-world datasets show that 1) our attack model significantly boosts the exposure rate of the target item in a stealthy way, without harming the accuracy of the poisoned recommender; and 2) existing defenses are not effective enough, highlighting the need for new defenses against our local model poisoning attacks to federated recommender systems.

Integrity signals

Registry

Crossref · 10.1145/3488560.3498386

Cites

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

  • Decentralized recommender systems remain vulnerable to threats such as inference attacks and differential attacks.

    “Although decentralized RS inherently provides a privacy protocol, as users preserve their entire historical data, and even FedRec prioritizes user privacy over DCS, it remains vulnerable to threats such as inference attacks and differential attacks [105, 138-142].”

Cites

Flagged first, then by citations

Cited by

Authors
Zhang, S., Yin, H., Chen, T., Huang, Z., Nguyen, Q. V. H., & Cui, L.
Affiliations
  • The University of Queensland (AU)
  • Griffith University (AU)
  • Shandong University (CN)
Venue
Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining
Publisher
ACM
Published
2022-02-11
Pages
1415-1423
OpenAlex
W4226493408
Cited by
98
References
2
Citations by year
2026: 8 · 2025: 22 · 2024: 41 · 2023: 23 · 2022: 4
FWCI
12.44
Type
conference paper
Language
en
Open access
closed
Locations
ACM International Conference on Web Search and Data Mining (WSDM) (publishedVersion)
Funders
Australian Research Council (FT210100624,DP190101985,DE200101465)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
federated learning, backdoor attacks, data poisoning, federated recommender systems, popularity bias, malicious users, stealthy attacks

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