Privacy Preserving Cooperative Clustering Service

  • Authors:
  • Ananda Swarup Das;Kannan Srinathan

  • Affiliations:
  • -;-

  • Venue:
  • ADCOM '07 Proceedings of the 15th International Conference on Advanced Computing and Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The growth of Internet has opened up new avenues for business and corporate model. Information sharing over In- ternet can help business houses in better cooperative strate- gic planning and growth. However despite such an impact, business houses are quite reluctant to share information be- cause of the fear of information leakage. In this paper we study and propose an elegant, simple and practical solu- tion 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 follow- ing 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 afore- mentioned problems have been considered in privacy pre- serving framework.