CART Algorithm for Two and Multi- Party

Abstract

In this  paper  we have  assumed  that participating parties  having  database that contains  private   data  are  vertically  partitioned.   We  have  proposed vertically  partitioned CART  algorithm  and  for privacy  preserving  privacy protocol  we have  combined  scalar  dot  product  protocol  and  xlnx protocol for efficiently preserving  privacy of private  data.  Later  we improved  privacy preserving  CART  algorithm  for multi-party and  for privacy  preservation secure sum protocol  and secure size of set intersection protocols  are used.