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.
By Longzhu He, Li Sun, Hao Peng, Ruijie Wang, Raymond Chi-Wing Wong, Sen Su
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:2604. 07125v2 Announce Type: replace-cross Abstract: This article presents DDP-SA, a scalable privacy-preserving federated learning framework that jointly leverages client-side local differential privacy (LDP) and full-threshold additive secret sharing (ASS) for secure aggregation.
By Wenjing Wei, Farid Nait-Abdesselam, Alla Jammine
arXiv:2606. 04399v1 Announce Type: new Abstract: In the paradigm of decentralized learning, a group of agents collaborate to train a global model using distributed datasets without a central server.
By Yunsheng Yuan, Xue Xiao, Lina Wang, Feng Li
arXiv:2509. 10691v3 Announce Type: replace-cross Abstract: Decentralized federated learning enables collaborative model training without a central server, but shared model updates can still leak sensitive information through inversion, reconstruction, and membership inference attacks.
By Fardin Jalil Piran, Zhiling Chen, Yang Zhang, Qianyu Zhou, Jiong Tang, Farhad Imani
arXiv:2608. 04255v1 Announce Type: cross Abstract: Graph inference over relational data can expose sensitive edge information, and this risk becomes more severe in dynamic graphs, where repeated model updates cause privacy loss to accumulate.
By Yuyang Xia, Ruixuan Liu, Li Xiong