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

View Sample PDF

Author(s): Sankita Patel (S. V. National Institute of Technology, India), Mitali Sonar (Shankersinh Vaghela Bapu Institute of Technology, India)and Devesh C. Jinwala (S. V. National Institute of Technology, India)
Copyright: 2019
Pages: 27
Source title: Cyber Law, Privacy, and Security: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-5225-8897-9.ch021

Keywords: Business & Management / Cyber Ethics / Information Science Reference / IT Security and Ethics

Purchase

View on the publisher's website for pricing and purchasing information.

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.

The IRMA Community

Research IRM

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

Purchase

Abstract

Related Content

IRMA Sponsors