K-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data
Gunjan Mishra, Kalyani Pathak, Yash Mishra, Pragati Jadhav, Vaishali, Keshervani

TL;DR
This paper presents a secure k-nearest neighbor classification algorithm designed for encrypted data in cloud environments, ensuring privacy of user data and access patterns while enabling effective data mining.
Contribution
It introduces a novel privacy-preserving classification protocol that operates over semantically secure encrypted relational data in cloud settings.
Findings
Maintains data privacy during classification
Protects user query privacy and access patterns
Enables effective data mining on encrypted data
Abstract
Data mining has various real-time applications in fields such as finance telecommunications, biology, and government. Classification is a primary task in data mining. With the rise of cloud computing, users can outsource and access their data from anywhere, offloading data and it is processing to the cloud. However, in public cloud environments while data is often encrypted, the cloud service provider typically controls the encryption keys, meaning they can potentially access the data at any time. This situation makes traditional privacy-preserving classification systems inadequate. The recommended protocol ensures data privacy, protects user queries, and conceals access patterns. Given that encrypted data on the cloud cannot be directly mined, we focus on a secure k nearest neighbor classification algorithm for encrypted, outsourced data. This approach maintains the privacy of user…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Security and Intrusion Detection · Security in Wireless Sensor Networks · Internet Traffic Analysis and Secure E-voting
