Privacy Preserving ID3 Algorithm over Horizontally Partitioned Data
Authors:
- Liu-Sheng HuangLHLiu-Sheng Huang
- Yong-Long LuoYLYong-Long Luo
- Hong ShenHSHong Shen
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23795352,p. 239-243
Abstract
For the problem of decision tree classification with privacy concerns, we propose several efficient secure multi-party computation protocols to construct a privacy preserving ID3 algorithm over horizontally partitioned data among multiple parties. Our algorithm presents the first solution to privacy preserving decision tree classification among more than two parties. We also make a performance comparison with the existing solution, which is only applicable to the twoparty case. The result shows that our solution has a significantly better performance.Keywords
This publication has 11 references indexed in Scilit:
- State-of-the-art in privacy preserving data miningACM SIGMOD Record, 2004
- Tools for privacy preserving distributed data miningACM SIGKDD Explorations Newsletter, 2002
- Privacy Preserving Data MiningJournal of Cryptology, 2002
- Oblivious transfer and polynomial evaluation1999
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999
- A new public key cryptosystem based on higher residues1998
- Multi party computations1997
- How to generate and exchange secrets1986
- Induction of decision treesMachine Learning, 1986
- A randomized protocol for signing contractsCommunications of the ACM, 1985