k-Anonymous data collection

  • Authors:
  • Sheng Zhong;Zhiqiang Yang;Tingting Chen

  • Affiliations:
  • Department of Computer Science and Engineering, State University of New York, Buffalo, Amherst, NY 14260, USA;Imagine Software, Inc., 233 Broadway, 17th floor, Newyork, NY 10279, USA;Department of Computer Science and Engineering, State University of New York, Buffalo, Amherst, NY 14260, USA

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

To protect individual privacy in data mining, when a miner collects data from respondents, the respondents should remain anonymous. The existing technique of Anonymity-Preserving Data Collection partially solves this problem, but it assumes that the data do not contain any identifying information about the corresponding respondents. On the other hand, the existing technique of Privacy-Enhancing k-Anonymization can make the collected data anonymous by eliminating the identifying information. However, it assumes that each respondent submits her data through an unidentified communication channel. In this paper, we propose k-Anonymous Data Collection, which has the advantages of both Anonymity-Preserving Data Collection and Privacy-Enhancing k-Anonymization but does not rely on their assumptions described above. We give rigorous proofs for the correctness and privacy of our protocol, and experimental results for its efficiency. Furthermore, we extend our solution to the fully malicious model, in which a dishonest participant can deviate from the protocol and behave arbitrarily.