Privacy-preserving decision trees over vertically partitioned data

ACM Transactions on Knowledge Discovery from Data

Volumn 2, Issue 3, 2008, Pages

  Vaidya, Jaideep ^a,e   Clifton, Chris ^b   Kantarcioglu, Murat ^c   Patterson, A Scott ^d  

^a RUTGERS UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

^c UNIVERSITY OF TEXAS AT DALLAS   (United States)

^d JOHNS HOPKINS UNIVERSITY   (United States)

^e RUTGERS UNIVERSITY   (United States)

Author keywords

Decision tree classification; Privacy

Indexed keywords

DATA DISTRIBUTED; DATA-MINING; DISTRIBUTED KNOWLEDGE DISCOVERIES; PRIVACY; PRIVACY AND SECURITIES; SECURE MULTIPARTY COMPUTATIONS;

DECISION SUPPORT SYSTEMS; DECISION THEORY; DECISION TREES; INFORMATION MANAGEMENT; MINING; TREES (MATHEMATICS);

SECURITY OF DATA;

EID: 55149091380     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1409620.1409624     Document Type: Article

References (41)

1. AGRAWAL, D. AND AGGARWAL, C. C. 2001. On the design and quantification of privacy preserving data mining algorithms. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, CA. ACM Press, New York, 247-255.
2. AGRAWAL, R., EVFIMIEVSKI, A., AND SRIKANT, R. 2008. Information sharing across private databases. In Proceedings of the ACM SIGMOD InternationalConference on Management of Data, San Diego, CA. ACM Press, New York.
3. AGRAWAL, R. AND SRIKANT, R. 2000. Privacy-Preserving data mining. In Proceedings of the ACM SIGMOD Conference on Management of Data, Dallas, TX. ACM Press, New York, 439-450.
4. ATALLAH, M. J., ELMONGUI, H. G., DESHPANDE, V., AND SCHWARZ, L. B. 2003. Secure supply-chain protocols. In Proceedings of the IEEE International Conference on E-Commerce, Newport Beach, CA. IEEE Computer Society Press, 293-302.
5. BLAKE, C. AND MERZ, C. 1998. UCI repository of machine learning databases. http://citeseer.comp.nus.edu.sg/context/123650/0.
6. COHEN, H., MIYAJI, A., AND ONO, T. 1998. Efficient elliptic curve exponentiation using mixed coordinates. In Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT). Springer-Verlag, London, UK, 51-65.
7. COX, M. J., ENGELSCHALL, R. S., HENSON, S., AND RIE, B. L. 1998-2005. The OpenSSL Toolkit.
8. CRAMER, R., DAMGARD, I., AND NIELSEN, J. B. 2001. Multiparty computation from threshold homomorphic encryption. In Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT). Springer-Verlag, London, UK, 280-299.
9. DAMGARD, I., JURIK, M., AND NIELSEN, J. 2003. A generalization of Paillier's public-key system with applications to electronic voting.
10. DU, W. AND ATALLAH, M. J. 2001. Secure multi-party computation problems and their applications: A review and open problems. In Proceedings of the New Security Paradigms Workshop. ACM, New York, 11-20.
11. DU, W. AND ZHAN, Z. 2002. Building decision tree classifier on private data. In Proceedings of the IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, Maebashi City, Japan, C. Clifton and V. Estivill-Castro, Eds. vol. 14. Australian Computer Society, 1-8.
12. DUDA, R. AND HART, P. E. 1973. Pattern Classification and Scene Analysis. John Wiley & Sons, Hoboken, NJ.
13. EVFIMIEVSKI, A., SRIKANT, R., AGRAWAL, R., AND GEHRKE, J. 2002. Privacy preserving mining of association rules. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, 217-228.
14. EVIDENCE-BASED MEDICINE WORKING GROUP. 1992. Evidence-Based medicine. A new approach to teaching the practice of medicine. J. Amer. Medical Assoc. 268, 17 (Nov.), 2420-2425.
15. FREEDMAN, M. J., NISSIM, K., AND PINKAS, B. 2004. Efficient private matching and set intersec-tion. In Proceedings of the 23rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, International Association for Cryptologic Research (IACR), Interlaken, Switzerland. Springer, 1-19.
16. GOETHALS, B., LAUR, S., LIPMAA, H., AND MIELIKÄINEN, T. 2004. On secure scalar product computation for privacy-preserving data mining. In Proceedings of the 7th Annual International Conference in Information Security and Cryptology (ICISC), New York, C. Park and S. Chee, Eds. vol. 3506, Springer, 104-120.
17. GOLDREICH, O. 2004. General Cryptographic Protocols, Vol. 2. In The Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge, UK, 599-764.
18. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1987. How to play any mental game - A completeness theorem for protocols with honest majority. In Proceedings of the 19th ACM Symposium on the Tfieory of Computing. ACM, New York, 218-229.
19. HUANG, Z., DU, W., AND CHEN, B. 2005. Deriving private information from randomized data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, MD. ACM Press, New York.
20. JAGANNATHAN, G. AND WRIGHT, R. N. 2005. Privacy-Preserving distributed k-means clustering over arbitrarily partitioned data. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, IL. ACM Press, New York, 593-599.
21. KANTARCIOGLU, M. AND CLIFTON, C. 2002. Privacy-Preserving distributed mining of association rules on horizontally partitioned data. In Praceedings of the ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD), Madison, WI. ACM Press, New York, 24-31.
22. KANTARCIOGLU, M. AND VAIDYA, J. 2002. An architecture for privacy-preserving mining of client information. In Proceedings of the IEEE International Conference on Data Mining, Workshop on Privacy, Security, and Data Mining, Maebashi City, Japan, C. Clifton and V. Estivill-Castro, Eds. vol. 14. Australian Computer Society, 37-42.
23. KANTARCIOǦLU, M. AND CLIFTON, C. 2004. Privacy-Preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16, 9 (Sept.), 1026-1037.
24. KARGUPTA, H., DATTA, S., WANG, Q., AND SIVAKUMAR, K. 2003. On the privacy preserving properties of random data perturbation techniques. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM). IEEE Computer Society, Los Alamitos, CA.
25. LEWIS, M. 2003. Department of defense appropriations act, 2004. Title VIII Section 8120. Enacted as Public Law 108-87.
26. LIN, X., CLIFTON, C., AND ZHU, M. 2005. Privacy preserving clustering with distributed EM mixture modeling. Knowl. Inf. Syst. 8, 1 (Jul.), 68-81.
27. LINDELL, Y. AND PINKAS, B. 2000. Privacy preserving data mining. In Advances in Cryptology (CRYPTO). Springer-Verlag, New York, NY, 36-54.
28. LINDELL, Y. AND PINKAS, B. 2002. Privacy preserving data mining. J. Cryptol. 15, 3, 177-206.
29. QUINLAN, J. R. 1986. Induction of decision trees. Mach. Learn. 1, 1, 81-106.
30. RIZVI, S. J. AND HARITSA, J. R. 2002. Maintaining data privacy in association rule mining. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), Hong Kong, VLDB Endowment, 682-693.
31. SCHNEIER, B. 1995. Applied Cryptography, 2nd ed. John Wiley & Sons, Hoboken, NJ.
32. SHIRAO, K., HOFF, P., OHTSU, A., LOEHRER, P., HYODO, I., WADLER, S., WADLEIGH, R., O'DWYER, P., MURO, K., YAMADA, Y., BOKU, N., NAGASHIMA, F., AND ABBRUZZESE, J. 2004. Comparison of the efficacy, toxicity, and pharmacokinetics of a uracil/tegafur (UFT) plus oral leucovorin (LV) regimen between Japanese and American patients with advanced colorectal cancer: Joint United States and Japan study of UFT/LV. J. Clinical Oncol. 22, 17 (Sept. 1), 3466-3474.
33. VAIDYA, J. AND CLIFTON, C. 2002. Privacy-Preserving association rule mining in vertically partitioned data. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada. ACM Press, New York, 639-644.
34. VAIDYA, J. AND CLIFTON, C. 2003. Privacy-preserving k -means clustering over vertically partitioned data. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC. ACM Press, New York, 206-215.
35. VAIDYA, J. AND CLIFTON, C. 2004. Privacy preserving naïve Bayes classifier for vertically partitioned data. In Proceedings of the SIAM International Conference on Data Mining, SIAM, Philadelphia, PA, 522-526.
36. VAIDYA, J. AND CLIFTON, C. 2005a. Privacy-Preserving decision trees over vertically partitioned data. In the 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Storrs, CT. Springer.
37. VAIDYA, J. AND CLIFTON, C. 2005b. Secure set intersection cardinality with application to association rule mining. J. Comput. Security 13, 4 (Nov.), 593-622.
38. WANG, K., XU, Y., SHE, R., AND YU, P. S. 2006. Classification spanning private databases. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park, CA.
39. WITTEN, I. H. AND FRANK, E. 1999. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco, CA.
40. WRIGHT, R. AND YANG, Z. 2004. Privacy-Preserving Bayesian network structure computation on distributed heterogeneous data. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA. ACM Press, New York.
41. YAO, A. C. 1986. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, CA, 162-167.