Fast Data Anonymization with Low Information Loss
Summary: One-dimensional quasi-identifiers enable linear-time heuristics for k-anonymity and l-diversity with meaningful information-loss metrics. Space-mapping generalizes to multi-dimensional data, yielding faster anonymization with lower loss and beating state-of-the-art in time and quality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Gabriel Ghinita (National University of Singapore)
- 2. Panagiotis Karras (University of Hong Kong)
- 3. Panos Kalnis (National University of Singapore)
- 4. Nikos Mamoulis (University of Hong Kong)
BibTeX Citation
@article{ghinita_vldb07,
title = {{Fast Data Anonymization with Low Information Loss}},
author = {Ghinita, Gabriel and Karras, Panagiotis and Kalnis, Panos and Mamoulis, Nikos},
journal = {PVLDB},
series = {{VLDB} '07},
volume = {1},
number = {1},
pages = {758--769},
doi = {10.14778/1281192.1281209},
url = {https://doi.org/10.14778/1281192.1281209},
year = {2007}
}
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,312 | Attacks on Privacy and deFinetti's Theorem | 2009 | SIGMOD | 8.6461872e-05 |
| 3,305 | Privacy-preserving Anonymization of Set-valued Data | 2008 | VLDB | 7.4208602e-05 |
| 9,198 | Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation | 2008 | SIGMOD | 5.1954442e-05 |
| 9,701 | Small Domain Randomization: Same Privacy, More Utility | 2010 | VLDB | 5.1258854e-05 |
| 9,703 | Preservation of Proximity Privacy in Publishing Numerical Sensitive Data | 2008 | SIGMOD | 5.1258854e-05 |
| 10,618 | Aegis: A Correlation-Based Data Masking Advisor for Data-Sharing Ecosystems | 2026 | SIGMOD | 4.9605343e-05 |
| 12,024 | When the Recursive Diversity Anonymity Meets the Ring Signature | 2021 | SIGMOD | 4.9605343e-05 |
| 12,764 | Non-homogeneous Generalization in Privacy Preserving Data Publishing | 2010 | SIGMOD | 4.9605343e-05 |
| 12,860 | TIAMAT: a Tool for Interactive Analysis of Microdata Anonymization Techniques | 2009 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11 | Implementing Data Cubes Efficiently | 1996 | SIGMOD | 0.00070860346 |
| 347 | Generalizing Data to Provide Anonymity when Disclosing Information | 1998 | PODS | 0.00020249479 |
| 406 | On the Complexity of Optimal K-Anonymity | 2004 | PODS | 0.00019009895 |
| 472 | Incognito: Efficient Full-Domain K-Anonymity | 2005 | SIGMOD | 0.00017689274 |
| 588 | Anatomy: Simple and Effective Privacy Preservation | 2006 | VLDB | 0.00015894454 |
| 1,714 | Injecting Utility into Anonymized Datasets | 2006 | SIGMOD | 9.7943215e-05 |
| 2,462 | Personalized Privacy Preservation | 2006 | SIGMOD | 8.4116174e-05 |
| 3,177 | Achieving Anonymity via Clustering | 2006 | PODS | 7.5481718e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,764 | Non-homogeneous Generalization in Privacy Preserving Data Publishing | 2010 | SIGMOD |
| 2 | 4,454 | Anonymization of Set-Valued Data via Top-Down, Local Generalization | 2009 | VLDB |
| 3 | 406 | On the Complexity of Optimal K-Anonymity | 2004 | PODS |
| 4 | 472 | Incognito: Efficient Full-Domain K-Anonymity | 2005 | SIGMOD |
| 5 | 1,876 | On k-Anonymity and the Curse of Dimensionality | 2005 | VLDB |
| 6 | 347 | Generalizing Data to Provide Anonymity when Disclosing Information | 1998 | PODS |
| 7 | 6,697 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD |
| 8 | 3,177 | Achieving Anonymity via Clustering | 2006 | PODS |
| 9 | 9,294 | Privacy Preservation by Disassociation | 2012 | VLDB |
| 10 | 3,305 | Privacy-preserving Anonymization of Set-valued Data | 2008 | VLDB |