Data Poisoning Attacks to Local Differential Privacy Protocols for Graphs
Xi He, Kai Huang, Qingqing Ye, Haibo Hu

TL;DR
This paper reveals vulnerabilities in local differential privacy protocols for graph data, demonstrating that attackers can inject fake data to significantly degrade metric accuracy, and proposes initial countermeasures.
Contribution
It introduces the first data poisoning attacks on LDP protocols for graphs and evaluates their impact on graph metrics like degree centrality and clustering coefficient.
Findings
Attacks can significantly reduce the accuracy of graph metrics.
Countermeasures tested are ineffective against the attacks.
Real-world datasets confirm attack effectiveness.
Abstract
Graph analysis has become increasingly popular with the prevalence of big data and machine learning. Traditional graph data analysis methods often assume the existence of a trusted third party to collect and store the graph data, which does not align with real-world situations. To address this, some research has proposed utilizing Local Differential Privacy (LDP) to collect graph data or graph metrics (e.g., clustering coefficient). This line of research focuses on collecting two atomic graph metrics (the adjacency bit vectors and node degrees) from each node locally under LDP to synthesize an entire graph or generate graph metrics. However, they have not considered the security issues of LDP for graphs. In this paper, we bridge the gap by demonstrating that an attacker can inject fake users into LDP protocols for graphs and design data poisoning attacks to degrade the quality of…
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.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Security in Wireless Sensor Networks · Internet Traffic Analysis and Secure E-voting
