Poisoning Attacks to Local Differential Privacy for Ranking Estimation
Pei Zhan (1, 2, 3), Peng Tang (1, 2, 3), Yangzhuo Li (1, 3), Puwen Wei (1, 3), Shanqing Guo (1, 3) ((1) School of Cyber Science, Technology, Shandong University, (2) Quan Cheng Laboratory, Jinan, China, (3) State Key Laboratory of Cryptography, Digital Economy Security

TL;DR
This paper introduces novel poisoning attack strategies against local differential privacy protocols for ranking estimation, demonstrating their effectiveness through theoretical analysis and empirical experiments, and highlighting the need for robust defenses.
Contribution
It presents new poisoning attack methods tailored for LDP ranking protocols and proposes strategies to optimize attack success, filling a gap in understanding vulnerabilities.
Findings
Attacks significantly alter ranking outcomes.
Theoretical analysis confirms attack effectiveness.
Empirical results validate attack strategies.
Abstract
Local differential privacy (LDP) involves users perturbing their inputs to provide plausible deniability of their data. However, this also makes LDP vulnerable to poisoning attacks. In this paper, we first introduce novel poisoning attacks for ranking estimation. These attacks are intricate, as fake attackers do not merely adjust the frequency of target items. Instead, they leverage a limited number of fake users to precisely modify frequencies, effectively altering item rankings to maximize gains. To tackle this challenge, we introduce the concepts of attack cost and optimal attack item (set), and propose corresponding strategies for kRR, OUE, and OLH protocols. For kRR, we iteratively select optimal attack items and allocate suitable fake users. For OUE, we iteratively determine optimal attack item sets and consider the incremental changes in item frequencies across different sets.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
