Privacy-preserving decision trees over vertically partitioned data

Jaideep Vaidya, Chris Clifton

Research output: Contribution to journalConference article

40 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)139-152
Number of pages14
JournalLecture Notes in Computer Science
Volume3654
DOIs
StatePublished - Jan 1 2005
Event19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security - Storrs, CT, United States
Duration: Aug 7 2005Aug 10 2005

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this