To Do or Not To Do: The Dilemma of Disclosing Anonymized Data

Summary: Examines the safety of anonymized data under frequent itemset mining; models attacker priors with belief functions and derives expected cracks across prior classes. Introduces a fast O-estimate heuristic, empirically accurate on real benchmarks, and delivers a practical decision recipe for releasing vs. disclosing risk. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3686
Venue: SIGMOD
Year: 2005
Pagerank: 5.3889537e-05
Overall Rank: 8,662 | 40.58%
DOI: 10.1145/1066157.1066165

Incoming Non-self Citations Over Time

Authors

1. Laks V.S. Lakshmanan (University of British Columbia)
2. Raymond T. Ng (University of British Columbia)
3. Ganesh Ramesh (University of British Columbia)

BibTeX Citation

@inproceedings{lakshmanan_sigmod05,
        title = {{To Do or Not To Do: The Dilemma of Disclosing Anonymized Data}},
        author = {Lakshmanan, Laks V.S. and Ng, Raymond T. and Ramesh, Ganesh},
        series = {{SIGMOD} '05},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1066157.1066165},
        url = {https://dl.acm.org/doi/10.1145/1066157.1066165},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,255	Attacks on Privacy and deFinetti's Theorem	2009	SIGMOD	8.8595313e-05

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.0006567919
70	Privacy-Preserving Data Mining	2000	SIGMOD	0.0003804755
123	Revealing Information while Preserving Privacy	2003	PODS	0.00031082693
244	On the Design and Quantification of Privacy Preserving Data Mining Algorithms	2001	PODS	0.00023476901
384	On the Complexity of Optimal K-Anonymity	2004	PODS	0.00019510305
5,731	Secure XML Publishing without Information Leakage in the Presence of Data Inference	2004	VLDB	6.106721e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,086	Privacy Preservation by Disassociation	2012	VLDB
2	7,875	Privacy-Enhancing k-Anonymization of Customer Data	2005	PODS
3	6,554	Approximate Algorithms for k-Anonymity	2007	SIGMOD
4	2,856	Publishing Set-Valued Data via Differential Privacy	2011	VLDB
5	12,506	Anonymized Data: Generation, Models, Usage	2009	SIGMOD
6	4,699	Fast Data Anonymization with Low Information Loss	2007	VLDB
7	3,110	Achieving Anonymity via Clustering	2006	PODS
8	9,486	Minimizing Minimality and Maximizing Utility: Analyzing Method-based attacks on Anonymized Data	2010	VLDB
9	1,746	The Boundary Between Privacy and Utility in Data Publishing	2007	VLDB
10	3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB