A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization

Maximizing data usage and minimizing privacy risk are two conflicting goals. Organizations always apply a set of transformations on their data before releasing it. While determining the best set of transformations has been the focus of extensive work in the database community, most of this work suff...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on knowledge and data engineering Ročník 26; číslo 7; s. 1591 - 1601
Hlavní autoři: Fouad, Mohamed R., Elbassioni, Khaled, Bertino, Elisa
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Aggregates
Algorithms
and protection
Communities
Data
Data privacy
Data sharing
Database design
Database Management
Information Storage and Retrieval
Information Technology and Systems
integrity
Knowledge and data engineering tools and techniques
modeling and management
Online Information Services
Privacy
Scalability
Security
Differential privacy
risk management
security
data utility
anonymity
data sharing
scalability
ISSN:1041-4347, 1558-2191
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Maximizing data usage and minimizing privacy risk are two conflicting goals. Organizations always apply a set of transformations on their data before releasing it. While determining the best set of transformations has been the focus of extensive work in the database community, most of this work suffered from one or both of the following major problems: scalability and privacy guarantee. Differential Privacy provides a theoretical formulation for privacy that ensures that the system essentially behaves the same way regardless of whether any individual is included in the database. In this paper, we address both scalability and privacy risk of data anonymization. We propose a scalable algorithm that meets differential privacy when applying a specific random sampling. The contribution of the paper is two-fold: 1) we propose a personalized anonymization technique based on an aggregate formulation and prove that it can be implemented in polynomial time; and 2) we show that combining the proposed aggregate formulation with specific sampling gives an anonymization algorithm that satisfies differential privacy. Our results rely heavily on exploring the supermodularity properties of the risk function, which allow us to employ techniques from convex optimization. Through experimental studies we compare our proposed algorithm with other anonymization schemes in terms of both time and privacy risk.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2013.107