Abstract
As a frequently used query operation for online applications, secure k-nearest neighbors (k-NN) computation on encrypted cloud data has received much attention. In this paper, we focus on the problem of supporting efficient k-NN computation over encrypted cloud data while data owner cannot share his secret keys with query users. We give a security analysis of the scheme proposed by Zhu et al. [16], and the analysis shows the scheme cannot provide query privacy at all. And we design a new efficient construction to support efficient k-NN computation over encrypted cloud data without key sharing. Additionally, security analysis is presented to demonstrate the new scheme can provide data privacy and query privacy in the Known Ciphertext Model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
