Third Party Data Clustering Over Encrypted Data Without Data Owner Participation: Introducing the Encrypted Distance Matrix

Almutairi, Nawal, Coenen, Frans ORCID: 0000-0003-1026-6649 and Dures, Keith (2018) Third Party Data Clustering Over Encrypted Data Without Data Owner Participation: Introducing the Encrypted Distance Matrix. .

Text kNNClusteringVer7.pdf - Author Accepted Manuscript Download (390kB)

Abstract

The increasing demand for Data Mining as a Service, using cloud storage, has raised data security concerns. Standard data encryption schemes are unsuitable because they do not support the mathematical operations that data mining requires. Homomorphic and Order Preserving Encryption provide a potential solution. Existing work, directed at data clustering, has demonstrated that using such schemes provides for secure data mining. However, to date, all proposed approaches have entailed some degree of data owner participation, in many cases the amount of participation is substantial. This paper proposes an approach to secure data clustering that does not require any data owner participation (once the data has been encrypted). The approach operates using the idea of an Encrypted Distance Matrix (EDM) which, for illustrative purposes, has been embedded in an approach to secure third-party data clustering - the Secure Nearest Neighbour Clustering (SNNC) approach, that uses order preserving and homomorphic encryption. Both the EDM concept and the SNNC approach are fully described.

Item Type:	Conference or Workshop Item (Unspecified)
Uncontrolled Keywords:	Privacy Preserving Data Mining, Secure Nearest Neighbour Clustering, Order Preserving Encryption, Homomorphic encryption
Depositing User:	Symplectic Admin
Date Deposited:	08 Jun 2018 10:47
Last Modified:	10 Feb 2023 23:08
DOI:	10.1007/978-3-319-98539-8_13
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3022337