Pith. sign in

REVIEW 1 cited by

GraphPub: Generation of Differential Privacy Graph with High Availability

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.00030 v2 pith:L3QM6O6F submitted 2024-02-28 cs.SI cs.AIcs.CRcs.LG

classification cs.SIcs.AIcs.CRcs.LG
keywords graphdataprivacyaccuracyaggregationavailabilitydifferentialedges
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In recent years, with the rapid development of graph neural networks (GNN), more and more graph datasets have been published for GNN tasks. However, when an upstream data owner publishes graph data, there are often many privacy concerns, because many real-world graph data contain sensitive information like person's friend list. Differential privacy (DP) is a common method to protect privacy, but due to the complex topological structure of graph data, applying DP on graphs often affects the message passing and aggregation of GNN models, leading to a decrease in model accuracy. In this paper, we propose a novel graph edge protection framework, graph publisher (GraphPub), which can protect graph topology while ensuring that the availability of data is basically unchanged. Through reverse learning and the encoder-decoder mechanism, we search for some false edges that do not have a large negative impact on the aggregation of node features, and use them to replace some real edges. The modified graph will be published, which is difficult to distinguish between real and false data. Sufficient experiments prove that our framework achieves model accuracy close to the original graph with an extremely low privacy budget.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    cs.LG 2026-07 reject novelty 5.0 of 10

    EdgeRefine denoises randomized-response graphs by ranking edges with Jaccard similarity and sampling a fixed quota from observed and non-observed edges, reporting near-noise-free GNN accuracy under edge differential privacy.

Pith tools