Aggregation and privacy in multi-relational databases

DOIResolve DOI:
AuthorSearch for: ; Search for: ; Search for:
Proceedings titlePrivacy, Security and Trust (PST), 2012 Tenth Annual International Conference on
Conference2012 10th Annual International Conference on Privacy, Security and Trust, PST 2012, July 16-18 2012, Paris, France
Article number6297921
Pages6774; # of pages: 8
SubjectAggregation functions; Data mining techniques; Predictive models; Privacy breaches; Privacy information; Privacy preserving data mining; Privacy violation; Relational Database; Aggregates; Data mining; Database systems; Data privacy
AbstractThe aim of privacy-preserving data mining is to construct highly accurate predictive models while not disclosing privacy information. Aggregation functions, such as sum and count are often used to pre-process the data prior to applying data mining techniques to relational databases. Often, it is implicitly assumed that the aggregated (or summarized) data are less likely to lead to privacy violations during data mining. This paper investigates this claim, within the relational database domain. We introduce the PBIRD (Privacy Breach Investigation in Relational Databases) methodology. Our experimental results show that aggregation potentially introduces new privacy violations. That is, potentially harmful attributes obtained with aggregation are often different from the ones obtained from non-aggregated databases. This indicates that, even when privacy is enforced on non-aggregated data, it is not automatically enforced on the corresponding aggregated data. Consequently, special care should be taken during model building in order to fully enforce privacy when the data are aggregated. © 2012 IEEE.
Publication date
AffiliationInformation and Communication Technologies; National Research Council Canada
Peer reviewedYes
NPARC number21269149
Export citationExport as RIS
Report a correctionReport a correction
Record identifier26be441a-9b02-480f-b4a4-abd515d28095
Record created2013-12-12
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)