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: 7594
Venue: SIGMOD
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,385 | 28.75%
DOI: 10.1145/3769808

Incoming Non-self Citations Over Time

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

Authors

1. Yihua Hu (Nanyang Technological University)
2. Hao Ding (Nanyang Technological University)
3. Wei Dong (Nanyang Technological University)

BibTeX Citation

@inproceedings{hu_sigmod26,
        title = {{N2E: A General Framework to Reduce Node-Differential Privacy to Edge-Differential Privacy for Graph Analytics}},
        author = {Hu, Yihua and Ding, Hao and Dong, Wei},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769808},
        url = {https://dl.acm.org/doi/10.1145/3769808},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,188	Acyclic Graph Pattern Counting under Local Differential Privacy	2026	SIGMOD	5.093636e-05

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
281	Towards Practical Differential Privacy for SQL Queries	2018	VLDB	0.00022445849
567	Understanding Hierarchical Methods for Differentially Private Histograms	2013	VLDB	0.00016420715
596	Private Analysis of Graph Structure	2011	VLDB	0.00015926024
836	Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins	2013	SIGMOD	0.00013715654
1,790	Publishing Graph Degree Distribution with Node Differential Privacy	2016	SIGMOD	9.7502278e-05
1,960	Private Release of Graph Statistics using Ladder Functions	2015	SIGMOD	9.4058693e-05
3,948	Shortest Paths and Distances with Differential Privacy	2016	PODS	6.9993183e-05
4,394	R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys	2022	SIGMOD	6.7274063e-05
6,367	Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy	2025	SIGMOD	5.8981989e-05
6,534	Better than Composition: How to Answer Multiple Relational Queries under Differential Privacy	2023	SIGMOD	5.8486828e-05
6,666	Residual Sensitivity for Differentially Private Multi-Way Joins	2021	SIGMOD	5.8086805e-05
7,292	A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries	2022	PODS	5.653597e-05
8,158	Continual Observation of Joins under Differential Privacy	2024	SIGMOD	5.4756587e-05
9,054	Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise	2025	VLDB	5.3251649e-05
11,369	Universal Private Estimators	2023	PODS	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	985	Towards Identity Anonymization on Graphs	2008	SIGMOD
2	10,446	Efficient and Effective Biclique Counting with Local Differential Privacy	2026	SIGMOD
3	836	Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins	2013	SIGMOD
4	6,826	Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy	2025	PODS
5	7,338	DPGraph: A Benchmark Platform for Differentially Private Graph Analysis	2021	SIGMOD
6	6,083	Global and Local Differentially Private Release of Count-Weighted Graphs	2023	SIGMOD
7	9,552	Practical and Accurate Local Edge Differentially Private Graph Algorithms	2025	VLDB
8	1,790	Publishing Graph Degree Distribution with Node Differential Privacy	2016	SIGMOD
9	6,367	Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy	2025	SIGMOD
10	9,557	Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy	2024	SIGMOD