arXiv Machine Learning

Trust-But-Verify: Poisoning-Resilient Locally Private Graph Learning Protocols

The paper introduces VERITAS, a poisoning‑resilient protocol for locally private graph learning that combines local differential privacy with a trust‑but‑verify approach. VERITAS employs a verification list to encode peer trust, performs local data perturbation, server‑side malicious node pruning, dual denoising, and robust private graph learning. Experiments on four real‑world datasets show that VERITAS defends against data poisoning attacks while improving downstream graph learning utility under strict privacy guarantees.

arXiv Machine Learning
Aug 27

Are LLM-Enhanced GNNs Privacy-Safe?

The paper evaluates privacy risks in graph neural networks enhanced by large language models (LLMs). Using a five‑stage framework, the authors test six real‑world text‑attributed graph datasets with 42 model configurations and six privacy attack methods across link, label, and membership inference threats. Results show that LLM‑enhanced GNNs are more vulnerable than shallow baselines, with semantic enrichment amplifying exploitable signals, and that differential privacy can reduce risk but at a significant cost to utility.

By Longzhu He, Zelang Wen, Chaozhuo Li, Sen Su
arXiv Machine Learning
Jul 10

EdgeRefine: Privacy-Utility Balance for Graphs via Jaccard Sampling under Edge Differential Privacy

arXiv:2607. 08659v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have shown considerable success in learning from graph-structured data, but their use in privacy-sensitive areas remains difficult because graph structure can leak sensitive link information.

By Wenxiu Ding, Muzhi Liu, Zheng Yan, Mingjun Wang, Yifan Zhao, Qiao Liu
arXiv Machine Learning
Aug 3

Communication-Efficient Secure Aggregation in Decentralized Learning

arXiv:2405. 07708v3 Announce Type: replace Abstract: Decentralized learning (DL) enables participants to collaboratively train models without a central server, yet it faces significant scalability challenges that demand sparsification to reduce the prohibitive communication costs of peer-to-peer exchange.

By Sayan Biswas, Anne-Marie Kermarrec, Rafael Pires, Rishi Sharma, Milos Vujasinovic