A novel approach: CART algorithm for vertically partitioned database in multi-party environment

Advancement of technology and use of distributed database has made an increasing concern about privacy of private data. Collaboration and team work brings huge and demanding result. But organizations are unwilling to participate for data mining due to data leakage. For availing huge demanding result, it is required to use and collect data from different participating parties in a secured way, that is, no data leakage and to use correct decision tree algorithm that can correctly model the data and show accurate result. This paper represents how CART algorithm can be used for multi parties in vertically partitioned environment. For security purpose, secure sum and secure size of set intersection protocols are used.