Full Citation

Title: Secure Distributed Computation of Anonymized Views of Shared Databases

Citation Type: Miscellaneous

Publication Year: 2012

ISBN:

ISSN:

DOI:

NSFID:

PMCID:

PMID:

Abstract: We consider the problem of computing efficient anonymizations of partitioned databases. Given a database that is partitioned between several sites, either horizontally or vertically, we devise secure distributed algorithms that allow the different sites to obtain a k-anonymized and -diverse view of the union of their databases, without disclosing sensitive information. Our algorithms are based on the sequential algorithm [20] that offers anonymizations with utility that is significantlybetter than other anonymization algorithms, and in particular those that were implemented so far in the distributed setting. Our algorithms can apply to different generalization techniques and utility measures and to any number of sites. While previous distributed algorithms depend on costly cryptographic primitives, the cryptographic assumptions of our solution are surprisingly minimal.

User Submitted?: No

Authors: Gudes, Ehud; Tassa, Tamir

Publisher: The Open University

Data Collections: IPUMS USA

Topics: Other

Countries: