Efficient and secure nearest neighbor search over encrypted data in cloud environment

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nearest neighbor search is the most general search queries on large data sets, location base services, spatial databases, graph applications, etc. With the growth of cloud computing, the trend of outsourcing the sensitive data demands the fast and secure nearest neighbor solutions over the existing solutions. In our paper, propose a new secure and efficient nearest neighbor search for encrypted data with mOPE (mutable order preserving encryption). In our proposed model use the probabilistic data structure skip graph for the efficient indexing. Then encrypt the indexes using mOPE for efficient nearest neighbor search. With the thorough analysis of our scheme achieve a perfect balance between security and nearest neighbor search query compared to another scheme.

Cite

CITATION STYLE

APA

Upinder, K., & Suri Pushpa, R. (2018). Efficient and secure nearest neighbor search over encrypted data in cloud environment. In Communications in Computer and Information Science (Vol. 799, pp. 587–598). Springer Verlag. https://doi.org/10.1007/978-981-10-8527-7_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free