Privacy-Preserving decision trees over vertically partitioned data

  • Authors:
  • Jaideep Vaidya;Chris Clifton

  • Affiliations:
  • MSIS Department, Rutgers University, Newark, NJ;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

Privacy and security concerns can prevent sharing of data, derailing data mining projects.Distributed knowledge discovery, if done correctly, can alleviate this problem. In this paper, we tackle the problem of classification. We introduce a generalized privacy preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with the algorithm, we give a complete proof of security that gives a tight bound on the information revealed.