DBScholar

Back to papers

Anonymizing Bipartite Graph Data using Safe Groupings

Summary: Introduces (k,l)-groupings that anonymize entity-to-node mappings while preserving bipartite edges and aggregate structure exactly. Safe groupings resist multiple attacks; algorithms and experiments demonstrate strong privacy–utility tradeoffs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9909
Venue
VLDB
Year
2008
Pagerank
8.5885381e-05
Overall Rank
2,430 | 83.33%
DOI
10.14778/1454159.1454250

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{cormode_vldb08,
        title = {{Anonymizing Bipartite Graph Data using Safe Groupings}},
        author = {Cormode, Graham and Srivastava, Divesh and Yu, Ting and Zhang, Qing},
        journal = {PVLDB},
        series = {{VLDB} '08},
        volume = {1},
        number = {1},
        pages = {833--844},
        doi = {10.14778/1454159.1454250},
        url = {https://doi.org/10.14778/1454159.1454250},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
572 Anatomy: Simple and Effective Privacy Preservation 2006 VLDB 0.00016316092
1,295 Minimality Attack in Privacy Preserving Data Publishing 2007 VLDB 0.00011272398
Previous Page 1 / 1 Next

Semantically Similar Papers