Privacy-preserving decision trees over vertically partitioned data

  • Authors:
  • Jaideep Vaidya;Chris Clifton;Murat Kantarcioglu;A. Scott Patterson

  • Affiliations:
  • Rutgers University, Newark, NJ;Purdue University, West Lafayette, IN;University of Texas at Dallas, Richardson, TX;Johns Hopkins University, Baltimore, MD

  • Venue:
  • ACM Transactions on Knowledge Discovery from Data (TKDD)
  • Year:
  • 2008

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. We introduce a generalized privacy-preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with a proof of security, we discuss what would be necessary to make the protocols completely secure. We also provide experimental results, giving a first demonstration of the practical complexity of secure multiparty computation-based data mining.