Authors:
Nawal Almutairi
1
;
Frans Coenen
2
and
Keith Dures
2
Affiliations:
1
Department of Computer Science, University of Liverpool, U.K., Information Technology Department, College of Computer and Information Sciences, King Saud University, Riyadh and Saudi Arabia
;
2
Department of Computer Science, University of Liverpool and U.K.
Keyword(s):
Privacy Preserving Data Mining, Secure Clustering, Homomorphic Encryption, Order Preserving Encryption, Secure Chain Distance Matrices.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Business Analytics
;
Computational Intelligence
;
Data Analytics
;
Data Engineering
;
Evolutionary Computing
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Machine Learning
;
Soft Computing
;
Symbolic Systems
Abstract:
Secure data mining has emerged as an essential requirement for exchanging confidential data in terms of third party (outsourced) data analytics. An emerging form of encryption, Homomorphic Encryption, allows a limited amount of data manipulation and, when coupled with additional information, can facilitate secure third party data analytics. However, the resource required is substantial which leads to scalability issues. Moreover, in many cases, data owner participation can still be significant, thus not providing a full realisation of the vision of third party data analytics. The focus of this paper is therefore scalable and secure third party data clustering with only very limited data owner participation. To this end, the concept of Secure Chain Distance Matrices is proposed. The mechanism is fully described and analysed in the context of three different clustering algorithms. Excellent evaluation results were obtained.