CRMar 19, 2014

k-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data

arXiv:1403.5001v3231 citations
Originality Incremental advance
AI Analysis

This addresses privacy concerns for users outsourcing data mining tasks to the cloud, but it is incremental as it builds on existing secure computation models.

The paper tackles the problem of performing k-nearest neighbor classification on encrypted data in cloud computing, proposing a secure protocol that protects data confidentiality, user queries, and access patterns, with empirical efficiency analysis.

Data Mining has wide applications in many areas such as banking, medicine, scientific research and among government agencies. Classification is one of the commonly used tasks in data mining applications. For the past decade, due to the rise of various privacy issues, many theoretical and practical solutions to the classification problem have been proposed under different security models. However, with the recent popularity of cloud computing, users now have the opportunity to outsource their data, in encrypted form, as well as the data mining tasks to the cloud. Since the data on the cloud is in encrypted form, existing privacy preserving classification techniques are not applicable. In this paper, we focus on solving the classification problem over encrypted data. In particular, we propose a secure k-NN classifier over encrypted data in the cloud. The proposed k-NN protocol protects the confidentiality of the data, user's input query, and data access patterns. To the best of our knowledge, our work is the first to develop a secure k-NN classifier over encrypted data under the semi-honest model. Also, we empirically analyze the efficiency of our solution through various experiments.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes