rho-uncertainty: Inference-Proof Transaction Anonymization

Summary: rho-uncertainty is the first inference-proof privacy notion for transaction anonymization, guarding sensitive-item associations regardless of adversary knowledge without falsifying data. A hybrid generalization-suppression scheme achieves this with non-trivial information loss and outperforms perturbation baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10338
Venue: VLDB
Year: 2010
Pagerank: 6.1997164e-05
Overall Rank: 5,494 | 62.31%
DOI: 10.14778/1920841.1920971

Incoming Non-self Citations Over Time

Authors

1. Jianneng Cao (National University of Singapore)
2. Panagiotis Karras (National University of Singapore)
3. Chedy Raissi (INRIA)
4. Kian-Lee Tan (National University of Singapore)

BibTeX Citation

@article{cao_vldb10,
        title = {{rho-uncertainty: Inference-Proof Transaction Anonymization}},
        author = {Cao, Jianneng and Karras, Panagiotis and Raissi, Chedy and Tan, Kian-Lee},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        doi = {10.14778/1920841.1920971},
        url = {https://doi.org/10.14778/1920841.1920971},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,421	PrivBasis: Frequent Itemset Mining with Differential Privacy	2012	VLDB	0.00010828328
2,366	On Differentially Private Frequent Itemset Mining	2013	VLDB	8.6866148e-05
2,856	Publishing Set-Valued Data via Differential Privacy	2011	VLDB	8.0321774e-05
9,086	Privacy Preservation by Disassociation	2012	VLDB	5.3251649e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 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
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
218	Limiting Privacy Breaches in Privacy Preserving Data Mining	2003	PODS	0.00024420564
460	Mining Generalized Association Rules	1995	VLDB	0.00018071773
558	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB	0.00016530269
572	Anatomy: Simple and Effective Privacy Preservation	2006	VLDB	0.00016316092
886	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.0001340645
1,217	Maintaining Data Privacy in Association Rule Mining	2002	VLDB	0.00011627624
1,295	Minimality Attack in Privacy Preserving Data Publishing	2007	VLDB	0.00011272398
2,255	Attacks on Privacy and deFinetti's Theorem	2009	SIGMOD	8.8595313e-05
2,397	Personalized Privacy Preservation	2006	SIGMOD	8.6343421e-05
3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB	7.6179491e-05
4,344	Anonymization of Set-Valued Data via Top-Down, Local Generalization	2009	VLDB	6.7522581e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,397	Personalized Privacy Preservation	2006	SIGMOD
2	9,086	Privacy Preservation by Disassociation	2012	VLDB
3	1,674	The Tao of Inference in Privacy-Protected Databases	2018	VLDB
4	10,451	Enhancing Local Differential Privacy Accuracy by Exploiting Inherent Uncertainty	2026	SIGMOD
5	12,537	Distribution-based Microdata Anonymization	2009	VLDB
6	1,217	Maintaining Data Privacy in Association Rule Mining	2002	VLDB
7	12,326	Publishing Microdata with a Robust Privacy Guarantee	2012	VLDB
8	218	Limiting Privacy Breaches in Privacy Preserving Data Mining	2003	PODS
9	12,506	Anonymized Data: Generation, Models, Usage	2009	SIGMOD
10	3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB