Privacy preserving clustering for multi-party

  • Authors:
  • Weijia Yang;Shangteng Huang

  • Affiliations:
  • Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China

  • Venue:
  • DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Privacy concerns on sensitive data are now becoming indispensable in data mining and knowledge discovering. Data owners usually have different concerns for different data attributes. Meanwhile the collusion among malicious adversaries produces a severe threat to the security of data. In this paper, we present an efficient method to generate the attribute-wised orthogonal matrix for data transformation. Moreover, we introduce a privacy preserving method for clustering problem in multi-party condition. Our method can not only protect data in the semi-honest model but also in the malicious one. We also analyze the accuracy of the results, the privacy levels obtained, and their relations with the parameters in our method.