Privacy Preserving Data Mining-英文文献.pdfVIP

Privacy Preserving Data Mining∗ Yehuda Lindell Benny Pinkas† Department of Computer Science STAR Lab, Intertrust Technologies Weizmann Institute of Science 4750 Patrick Henry Drive Rehovot, Israel. Santa Clara CA 95054. lindell@wisdom.weizmann.ac.il bpinkas@, benny@ Abstract In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. Our work is motivated by the need to both protect privileged information and enable its use for research or other purposes. The above problem is a specific example of secure multi-party computation and as such, can be solved using known generic protocols. However, data mining algorithms are typically complex and, furthermore, the input usually consists of massive data sets. The generic protocols in such a case are of no practical use and therefore more efficient protocols are required. We focus on the problem of decision tree learning with the popular ID3 algorithm. Our protocol is considerably more efficient than generic solutions and demands both very few rounds of communication and reasonable bandwidth. Key words: Secure two-party computation, Oblivious transfer, Oblivious polynomial evaluation, Data mining, Decision trees. ∗An earlier version of this work appeared in [11]. †Most of this work was done while at the Weiz