Efficient privacy-preserving protocol for k-NN search over encrypted data in location-based service
DOI10.1155/2017/1490283zbMATH Open1380.90080OpenAlexW2779946411WikidataQ122958758 ScholiaQ122958758MaRDI QIDQ680776FDOQ680776
Authors: Huijuan Lian, Weidong Qiu, Di Yan, Zheng Huang, Jie Guo
Publication date: 29 January 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/1490283
Recommendations
mobile communication\(k\)-nearest neighbor (\(k\)-NN) searchlocation-based services (LBS)Moore curveprivate circular query protocol
Cites Work
- Homomorphic Evaluation of the AES Circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Space-filling curves
- (Leveled) fully homomorphic encryption without bootstrapping
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Fully homomorphic SIMD operations
- Advances in spatial and temporal databases. 10th international symposium, SSTD 2007, Boston, MA, USA, July 16--18, 2007. Proceedings
Cited In (1)
Uses Software
This page was built for publication: Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680776)