The Power of the Dinur-Nissim Algorithm: Breaking Privacy of Statistical and Graph Databases
Summary: Extends Dinur–Nissim: phi-weighted random-query attacks (iid φ with finite third moment) can reconstruct Ω(n) entries over much larger domains, preserving the quadratic perturbation–reconstruction tradeoff with stronger guarantees for Gaussian/Poisson/bounded φ. Also gives a matching upper bound for bit databases and extends the attack to recover many graph edges from subgraph statistics, delineating limits and new application domains. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Krzysztof Choromanski (Columbia University)
- 2. Tal Malkin (Columbia University)
BibTeX Citation
@inproceedings{choromanski_pods12,
address = {New York, NY, USA},
series = {{PODS} '12},
title = {{The Power of the Dinur-Nissim Algorithm: Breaking Privacy of Statistical and Graph Databases}},
url = {https://dl.acm.org/doi/10.1145/2213556.2213570},
doi = {10.1145/2213556.2213570},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Choromanski, Krzysztof and Malkin, Tal},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 70 | Privacy-Preserving Data Mining | 2000 | SIGMOD | 0.0003804755 |
| 123 | Revealing Information while Preserving Privacy | 2003 | PODS | 0.00031082693 |
| 2,401 | Simulatable Auditing | 2005 | PODS | 8.6299652e-05 |
| 3,296 | Towards Robustness in Query Auditing | 2006 | VLDB | 7.5459953e-05 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,001 | Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation | 2008 | SIGMOD |
| 2 | 12,079 | Design of Policy-Aware Differentially Private Algorithms | 2016 | VLDB |
| 3 | 2,862 | Privacy via Pseudorandom Sketches | 2006 | PODS |
| 4 | 2,167 | Optimizing error of high-dimensional statistical queries under differential privacy | 2018 | VLDB |
| 5 | 121 | Boosting the Accuracy of Differentially Private Histograms Through Consistency | 2010 | VLDB |
| 6 | 596 | Private Analysis of Graph Structure | 2011 | VLDB |
| 7 | 1,504 | A Data- and Workload-Aware Algorithm for Range Queries Under Differential Privacy | 2014 | VLDB |
| 8 | 3,935 | Output Perturbation with Query Relaxation | 2008 | VLDB |
| 9 | 510 | Practical Privacy: The SuLQ Framework | 2005 | PODS |
| 10 | 123 | Revealing Information while Preserving Privacy | 2003 | PODS |