Welcome to the InfoSci Platform
Reference Hub5
Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Verifiable Secret Sharing Scheme

Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Verifiable Secret Sharing Scheme

Sankita Patel, Mitali Sonar, Devesh C. Jinwala
Copyright: © 2014 |Volume: 5 |Issue: 2 |Pages: 27
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781466653689|DOI: 10.4018/ijdst.2014040104
Cite Article Cite Article

MLA

Patel, Sankita, et al. "Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Verifiable Secret Sharing Scheme." IJDST vol.5, no.2 2014: pp.44-70. http://doi.org/10.4018/ijdst.2014040104

APA

Patel, S., Sonar, M., & Jinwala, D. C. (2014). Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Verifiable Secret Sharing Scheme. International Journal of Distributed Systems and Technologies (IJDST), 5(2), 44-70. http://doi.org/10.4018/ijdst.2014040104

Chicago

Patel, Sankita, Mitali Sonar, and Devesh C. Jinwala. "Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Verifiable Secret Sharing Scheme," International Journal of Distributed Systems and Technologies (IJDST) 5, no.2: 44-70. http://doi.org/10.4018/ijdst.2014040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this article, the authors propose an approach for privacy preserving distributed clustering that assumes malicious model. In the literature, there do exist, numerous approaches that assume a semi honest model. However, such an assumption is, at best, reasonable in experimentations; rarely true in real world. Hence, it is essential to investigate approaches for privacy preservation using a malicious model. The authors use the Pederson's Verifiable Secret Sharing scheme ensuring the privacy using additively homomorphic secret sharing scheme. The trustworthiness of the data is assured using homomorphic commitments in Pederson's scheme. In addition, the authors propose two variants of the proposed approach - one for horizontally partitioned dataset and the other for vertically partitioned dataset. The experimental results show that the proposed approach is scalable in terms of dataset size. The authors also carry out experimentations to highlight the effectiveness of Verifiable Secret Sharing scheme against Zero Knowledge Proof scheme.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.