Privacy-Enhancing k-Anonymization of Customer Data

Summary: Protocols for distributed k‑anonymization: customers keep raw rows; miner only learns a k‑anonymous table—no trusted curator. Two formalizations with provably private, end‑to‑end solutions preventing identifier–sensitive linkage while enabling mining. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1347
Venue: PODS
Year: 2005
Pagerank: 5.5253531e-05
Overall Rank: 7,875 | 45.98%
DOI: 10.1145/1065167.1065185

Incoming Non-self Citations Over Time

Authors

1. Sheng Zhong (Rutgers University; Stevens Institute of Technology)
2. Zhiqiang Yang (Stevens Institute of Technology)
3. Rebecca N. Wright (Stevens Institute of Technology)

BibTeX Citation

@inproceedings{zhong_pods05,
        address = {New York, NY, USA},
        series = {{PODS} '05},
        title = {{Privacy-Enhancing k-Anonymization of Customer Data}},
        url = {https://dl.acm.org/doi/10.1145/1065167.1065185},
        doi = {10.1145/1065167.1065185},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Zhong, Sheng and Yang, Zhiqiang and Wright, Rebecca N.},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,397	Personalized Privacy Preservation	2006	SIGMOD	8.6343421e-05

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
70	Privacy-Preserving Data Mining	2000	SIGMOD	0.0003804755
123	Revealing Information while Preserving Privacy	2003	PODS	0.00031082693
218	Limiting Privacy Breaches in Privacy Preserving Data Mining	2003	PODS	0.00024420564
244	On the Design and Quantification of Privacy Preserving Data Mining Algorithms	2001	PODS	0.00023476901
249	Statistical Databases: Characteristics, Problems, and Some Solutions	1982	VLDB	0.00023275528
338	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS	0.00020731054
384	On the Complexity of Optimal K-Anonymity	2004	PODS	0.00019510305
2,017	Auditing Boolean Attributes	2000	PODS	9.3006188e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	450	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD
2	9,086	Privacy Preservation by Disassociation	2012	VLDB
3	2,430	Anonymizing Bipartite Graph Data using Safe Groupings	2008	VLDB
4	9,486	Minimizing Minimality and Maximizing Utility: Analyzing Method-based attacks on Anonymized Data	2010	VLDB
5	338	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS
6	4,699	Fast Data Anonymization with Low Information Loss	2007	VLDB
7	218	Limiting Privacy Breaches in Privacy Preserving Data Mining	2003	PODS
8	12,424	Non-homogeneous Generalization in Privacy Preserving Data Publishing	2010	SIGMOD
9	3,110	Achieving Anonymity via Clustering	2006	PODS
10	3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB