Privacy-preserving distributed k-anonymity

  • Authors:
  • Wei Jiang;Chris Clifton

  • Affiliations:
  • Department of Computer Science, Purdue University, West Lafayette, IN;Department of Computer Science, Purdue University, West Lafayette, IN

  • Venue:
  • DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. This paper presents a k-anonymity protocol when the data is vertically partitioned between sites. A key contribution is a proof that the protocol preserves k-anonymity between the sites: While one site may have individually identifiable data, it learns nothing that violates k-anonymity with respect to the data at the other site. This is a fundamentally different distributed privacy definition than that of Secure Multiparty Computation, and it provides a better match with both ethical and legal views of privacy.