International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 116 | Views: 172

Survey Paper | Computer Science & Engineering | India | Volume 4 Issue 6, June 2015


Survey on K-Nearest Neighbor Categorization over Semantically Protected Encrypted Relational Information

Pranali D. Desai | Vinod S. Wadne [3]


Abstract: Data Mining has wide use in many fields such as financial, medication, medical research and among govt. departments. Classification is one of the widely applied works in data mining applications. For the past several years, due to the increase of various privacy problems, many conceptual and realistic alternatives to the classification issue have been suggested under various protection designs. On the other hand, with the latest reputation of cloud processing, users now have to be able to delegate their data, in encoded form, as well as the information mining task to the cloud. Considering that the information on the cloud is in secured type, current privacy-preserving classification methods are not appropriate. In this paper, we concentrate on fixing the classification issue over encoded data. In specific, we recommend a protected k-NN classifier over secured data in the cloud. The suggested protocol defends the privacy of information, comfort of user-s feedback query, and conceals the information access styles. To the best of our information, our task is the first to create a protected k-NN classifier over secured data under the semi-honest model. Also, we empirically evaluate the performance of our suggested protocol utilizing a real-world dataset under various parameter configurations.


Keywords: Security, k-NN classifier, outsourced databases, encryption


Edition: Volume 4 Issue 6, June 2015,


Pages: 709 - 711


How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link


Verification Code will appear in 2 Seconds ... Wait

Top