DBScholar

Back to papers

SPARSI: Partitioning Sensitive Data amongst Multiple Adversaries

Summary: SPARSI presents privacy-aware data partitioning: distribute sensitive data among k non-colluding adversaries to maximize utility while minimizing disclosure. A hypergraph model encodes interdependencies of private information; NP-hard in general, with relaxations and a local-search algorithm; evaluated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10836
Venue
VLDB
Year
2013
Pagerank
5.4119882e-05
Overall Rank
8,540 | 41.41%
DOI
10.14778/2536258.2536270

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{rekatsinas_vldb13,
        title = {{SPARSI: Partitioning Sensitive Data amongst Multiple Adversaries}},
        author = {Rekatsinas, Theodoros and Deshpande, Amol and Machanavajjhala, Ashwin},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {13},
        pages = {1594--1605},
        doi = {10.14778/2536258.2536270},
        url = {https://doi.org/10.14778/2536258.2536270},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,258 Win-Win: On Simultaneous Clustering and Imputing over Incomplete Data 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers