arrow
Return

Scalable Distributed Data Anonymization for Large Datasets

delete2023-06-01
delete1
delete
OA
AI
S
Sabrina De Capitani di Vimercati *
D
Dario Facchinetti
S
Sara Foresti
G
Giovanni Livraga
G
Gianluca Oldani
S
Stefano Paraboschi
M
Matthew Rossi
P
Pierangela Samarati
DOI:10.1109/TBDATA.2022.3207521delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
k-Anonymity and `-diversity are two well-known privacy metrics that guarantee protection of the respondents of a dataset by obfuscating information that can disclose their identities and sensitive information. Existing solutions for enforcing them implicitly assume to operate in a centralized scenario, since they require complete visibility over the dataset to be anonymized, and can therefore have limited applicability in anonymizing large datasets. In this article, we propose a solution that extends Mondrian (an efficient and effective approach designed for achieving k-anonymity) for enforcing both k-anonymity and `-diversity over large datasets in a distributed manner, leveraging the parallel computation of multiple workers. Our approach efficiently distributes the computation among the workers, without requiring visibility over the dataset in its entirety. Our data partitioning limits the need for workers to exchange data, so that each worker can independently anonymize a portion of the dataset. We implemented our approach providing parallel execution on a dynamically chosen number of workers. The experimental evaluation shows that our solution provides scalability, while not affecting the quality of the resulting anonymization.
Keywords:
Distributed data anonymization
mondrian
k-anonymity
l-diversity
apache spark

Journal

I
IEEE Transactions on Big Data
IF:
5.7
Papers:
834
Citations:
3.0K

Organization

U
University of Bergamo
Scholars:
1.6K
Papers: 1.9K
Citations: 4
U
University of Milan
Scholars:
5.1W
Papers: 3.9W
Citations: 5.0W