N2E: A General Framework to Reduce Node-Differential Privacy to Edge-Differential Privacy for Graph Analytics

Summary: N2E reduces node-DP graph analytics to edge-DP via distance-preserving clipping and a node-DP max-degree estimator, so error scales with the graph's true max degree instead of a conservative worst-case bound. Instantiations yield first node-DP solutions (e.g., max-degree, degree distribution), match optimal edge-count error, and show up to 2.5× (edge count) and 80× (degree distribution) empirical error reductions. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID: 7404
Venue: SIGMOD
Year: 2026
Pagerank: 4.1945683e-05
Overall Rank: 10,094 | 29.78%
DOI: 10.1145/3769808

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
453	Towards Practical Differential Privacy for SQL Queries	2018	VLDB	0.00022741848
642	Private Analysis of Graph Structure	2011	VLDB	0.00018755196
719	Understanding Hierarchical Methods for Differentially Private Histograms	2013	VLDB	0.00017626484
1,177	Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins	2013	SIGMOD	0.00013470212
2,226	Publishing Graph Degree Distribution with Node Differential Privacy	2016	SIGMOD	9.2421776e-05
2,683	Private Release of Graph Statistics using Ladder Functions	2015	SIGMOD	8.315553e-05
3,325	Shortest Paths and Distances with Differential Privacy	2016	PODS	7.2211576e-05
5,491	R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys	2022	SIGMOD	5.4776364e-05
5,885	Continual Observation of Joins under Differential Privacy	2024	SIGMOD	5.2880878e-05
7,064	Residual Sensitivity for Differentially Private Multi-Way Joins	2021	SIGMOD	4.8450749e-05
7,439	Better than Composition: How to Answer Multiple Relational Queries under Differential Privacy	2023	SIGMOD	4.7304034e-05
7,579	A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries	2022	PODS	4.706055e-05
8,234	Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy	2025	SIGMOD	4.5535352e-05
9,033	Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise	2025	VLDB	4.4039656e-05
11,163	Universal Private Estimators	2023	PODS	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
803	Towards Identity Anonymization on Graphs	2008	SIGMOD	0.00016478924
10,157	Efficient and Effective Biclique Counting with Local Differential Privacy	2026	SIGMOD	4.1945683e-05
1,177	Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins	2013	SIGMOD	0.00013470212
10,348	Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy	2025	PODS	4.1945683e-05
7,940	DPGraph: A Benchmark Platform for Differentially Private Graph Analysis	2021	SIGMOD	4.613363e-05
6,235	Global and Local Differentially Private Release of Count-Weighted Graphs	2023	SIGMOD	5.1451658e-05
10,727	Practical and Accurate Local Edge Differentially Private Graph Algorithms	2025	VLDB	4.1945683e-05
2,226	Publishing Graph Degree Distribution with Node Differential Privacy	2016	SIGMOD	9.2421776e-05
8,234	Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy	2025	SIGMOD	4.5535352e-05
9,405	Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy	2024	SIGMOD	4.3441378e-05