DBScholar

Back to papers

Privacy: From Database Reconstruction to Legal Theorems

Summary: Formalizes legal privacy standards as provable "legal theorems" to bridge legal and technical gaps, mapping concepts like GDPR "singling out" into precise mathematical definitions. Proves whether mechanisms (k‑anonymity, differential privacy) and reconstruction attacks meet those legal notions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h740fbcc8f9ffdf31
Venue
PODS
Year
2021
Pagerank
4.9793485e-05
Overall Rank
11,949 | 19.67%
DOI
10.1145/3452021.3458816

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{nissim_pods21,
        address = {New York, NY, USA},
        series = {{PODS} '21},
        title = {{Privacy: From Database Reconstruction to Legal Theorems}},
        url = {https://dl.acm.org/doi/10.1145/3452021.3458816},
        doi = {10.1145/3452021.3458816},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Nissim, Kobbi},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
122 Revealing Information while Preserving Privacy 2003 PODS 0.00030770793
347 Generalizing Data to Provide Anonymity when Disclosing Information 1998 PODS 0.00020325683
404 On the Complexity of Optimal K-Anonymity 2004 PODS 0.00019081867
Previous Page 1 / 1 Next

Semantically Similar Papers