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.
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.
arXiv:2607. 04777v1 Announce Type: new Abstract: Graph-structured data is increasingly generated and stored in decentralized environments, such as social platforms, mobile applications, and edge networks, where users maintain control over their local graph data.
arXiv:2601. 17130v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are widely used for tasks such as node classification and link prediction, but their use in sensitive settings raises concerns about training-data leakage.
arXiv:2311.16139v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have become indispensable tools for learning from graph structured data, catering to various applications such a...
arXiv:2606. 04069v1 Announce Type: cross Abstract: Existing privacy analyses for Graph Neural Networks (GNNs) largely inherit assumptions from non-graph settings, overlooking structural correlations and stochastic training-graph sampling.
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.
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.
The paper presents an empirical audit of privacy leakage in edge‑private graph generators by testing whether outputs from edge‑neighbouring inputs remain distinguishable. It introduces statistically valid lower bounds on privacy loss and compares direct‑edge, local‑structural, and GNN‑based attacks based on the geometry around a target edge. Experiments on two generators and two networks reveal that privacy leakage varies with both the mechanism and the network, and that learned representations expose information beyond conventional local statistics.
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.
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.
arXiv:2503. 22998v2 Announce Type: replace-cross Abstract: Despite advancements in Graph Neural Networks (GNNs), adaptive attacks continue to challenge their robustness.
arXiv:2606. 29748v1 Announce Type: new Abstract: The application of graph data in numerous disciplines raises the need for gathering and analyzing huge volumes of data, some of which is private and sensitive.