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.
Full Text:
PDFCopyright (c) 2017 Edupedia Publications Pvt Ltd
![Creative Commons License](http://licensebuttons.net/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All published Articles are Open Access at https://journals.pen2print.org/index.php/ijr/
Paper submission: ijr@pen2print.org