• DocumentCode
    3756281
  • Title

    Privacy-Preserving and Outsourced Multi-user K-Means Clustering

  • Author

    Fang-Yu Rao;Bharath K. Samanthula;Elisa Bertino;Xun Yi;Dongxi Liu

  • Author_Institution
    Purdue Univ., West Lafayette, IN, USA
  • fYear
    2015
  • Firstpage
    80
  • Lastpage
    89
  • Abstract
    Many techniques for privacy-preserving data mining (PPDM) have been investigated over the past decade. Such techniques, however, usually incur heavy computational and communication cost on the participating parties and thus entities with limited resources may have to refrain from participating in the PPDM process. To address this issue, one promising solution is to outsource the tasks to the cloud environment. In this paper, we propose a novel and efficient solution to privacy-preserving outsourced distributed clustering (PPODC) for multiple users based on the k-means clustering algorithm. The main novelty of our solution lies in avoiding the secure division operations required in computing cluster centers through efficient transformation techniques. In addition, we discuss two strategies, namely offline computation and pipelined execution that aim to boost the performance of our protocol. We implement our protocol on a cluster of 16 nodes and demonstrate how our two strategies combined with parallelism can significantly improve the performance of our protocol through extensive experiments using a real dataset.
  • Keywords
    "Clustering algorithms","Cryptography","Protocols","Databases","Cloud computing","Standards","Euclidean distance"
  • Publisher
    ieee
  • Conference_Titel
    Collaboration and Internet Computing (CIC), 2015 IEEE Conference on
  • Type

    conf

  • DOI
    10.1109/CIC.2015.20
  • Filename
    7423068