An Efficient Approach for Privacy Preserving Distributed K-Means Clustering Based on Shamir’s Secret Sharing Scheme

Abstract : Privacy preserving data mining has gained considerable attention because of the increased concerns to ensure privacy of sensitive information. Amongst the two basic approaches for privacy preserving data mining, viz. Randomization based and Cryptography based, the later provides high level of privacy but incurs higher computational as well as communication overhead. Hence, it is necessary to explore alternative techniques that improve the overheads. In this work, we propose an efficient, collusion-resistant cryptography based approach for distributed K-Means clustering using Shamir’s secret sharing scheme. As we show from theoretical and practical analysis, our approach is provably secure and does not require a trusted third party. In addition, it has negligible computational overhead as compared to the existing approaches.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01517655
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 3, 2017 - 2:49:12 PM
Last modification on : Wednesday, May 3, 2017 - 2:52:07 PM
Document(s) archivé(s) le : Friday, August 4, 2017 - 1:25:46 PM

File

978-3-642-29852-3_9_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Sankita Patel, Sweta Garasia, Devesh Jinwala. An Efficient Approach for Privacy Preserving Distributed K-Means Clustering Based on Shamir’s Secret Sharing Scheme. 6th International Conference on Trust Management (TM), May 2012, Surat, India. pp.129-141, ⟨10.1007/978-3-642-29852-3_9⟩. ⟨hal-01517655⟩

Share

Metrics

Record views

202

Files downloads

86