Efficient Table Anonymization for Aggregate Query Answering

Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonymization schemes, such as ? -anonymity, ? -diversity, ? -closeness and ?? anonymity. It is important that the table anonymization preserves sufficient information to support ad hoc aggregate queries over the data, and to return reasonably accurate answers. The recent framework of permutation-based anonymization was shown to be better than generalization based approaches in answering aggregate queries with sufficient accuracy, while providing strong anonymity guarantees. In this paper, we focus attention on the case when the sensitive attributes are numerical (e.g., salary) and ?? -anonymity has been shown to be an appropriate privacy goal. We develop efficient algorithms for several criteria to optimize accurate answering of aggregate queries, under permutation-based anonymization schemes, significantly improv...

• Type: Conference
• Year: 2009
• Where: ICDE
• Authors: Cecilia M. Procopiuc, Divesh Srivastava
• Keywords: Ad Hoc Analyses, Appropriate Privacy Goal, Database, Hoc Aggregate Queries, ICDE 2009, Query Accuracy Criteria, Strong Anonymity Guarantees