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

  title={Third Party Data Clustering Over Encrypted Data Without Data Owner Participation: Introducing the Encrypted Distance Matrix},
  author={Nawal Almutairi and Frans Coenen and Keith Dures},
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… 
Secure third‐party data clustering using SecureCL, Φ‐data and multi‐user order preserving encryption
The reported experiments demonstrate that SecureCL can produce securely cluster configurations comparable to those produced using standard, non‐encrypted, approaches without entailing any significant computational overhead, thus indicating its suitability in the context of Data Mining as a Service.
Analysis and Research Based on Instrument Drift Data
A set of application systems for instrument data import, export, storage, and analysis, which can store instrument calibration data onto a Hadoop database in a prescribed format provides great reference values for the calibration of instrument data.


K-Means Clustering Using Homomorphic Encryption and an Updatable Distance Matrix: Secure Third Party Data Clustering with Limited Data Owner Interaction
A mechanism for secure k-means clustering that uses Homomorphic Encryption (HE) and the concept of an Updatable Distance Matrix (UDM) is proposed that allows the application of clustering algorithms to encrypted data while preserving both correctness and data privacy.
k-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data
This work is the first to develop a secure k-NN classifier over encrypted data under the semi-honest model and empirically analyzes the efficiency of the proposed protocol using a real-world dataset under different parameter settings.
Secure k-NN query on encrypted cloud database without key-sharing
This paper proposes a novel secure and practical scheme for preserving data privacy and supporting k-NN query on encrypted cloud data, and shows that the data privacy can be protected even when query users leak their knowledge about the key to adversary.
Privacy of outsourced k-means clustering
This paper presents a method that allows the data owner to encrypt its data with a homomorphic encryption scheme and the service provider to perform k-means clustering directly over the encrypted data.
Secure k-NN Query on Encrypted Cloud Data with Limited Key-Disclosure and Offline Data Owner
This paper presents a new scheme to support k-NN query on encrypted cloud database while preserving the privacy of database and query points and only discloses limited information about the key to query users, and does not require an online data owner.
Nonlinear order preserving index for encrypted database query in service cloud environments
This paper proposes a nonlinear order preserving scheme for indexing encrypted data, which facilitates the range queries over encrypted databases and provides the capability of hiding the distribution of plaintexts from the Distribution of indexes.
Secure Data Mining in Cloud Using Homomorphic Encryption
This thesis proposes a secure k-means data mining approach assuming the data to be distributed among different hosts preserving the privacy of the data that is able to maintain the correctness and validity of the existing k-Means to generate the final results even in the distributed environment.
New order preserving encryption model for outsourced databases in cloud environments
Privacy-Preserving and Outsourced Multi-user K-Means Clustering
A novel and efficient solution to privacy-preserving outsourced outsourced distributed clustering (PPODC) for multiple users based on the k-means clustering algorithm based on efficient transformation techniques is proposed.
The Research of Privacy-Preserving Clustering Algorithm
Theoretical analysis and examples illustrate that the proposed HDPPDK-Means clustering algorithm can effectively solve privacy-preserving problem of clustering mining over horizontal distribution and achieve the privacy- Preserving aim.