Privacy Preserving Cooperative Clustering Service
Ananda Swarup Das, Kannan Srinathan · 2007
The growth of Internet has opened up new avenues for business and corporate model. Information sharing over Internet can help business houses in better cooperative strategic planning and growth. However despite such an impact, business houses are quite reluctant to share information because of the fear of information leakage. In this paper we study and propose an elegant, simple and practical solution for the problem of how can one party avail the data clustering service of another party without affecting each other's privacy. In our solution, we introduce the following two problems: (a) Secure multiparty computation of a depth of a query point, (b) Secure multiparty computation of whether a query point is a hull vertex. To the best of our knowledge this is the first time in literature that the aforementioned problems have been considered in privacy preserving framework.