Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service

DOI10.1155/2017/1490283zbMath1380.90080OpenAlexW2779946411WikidataQ122958758 ScholiaQ122958758MaRDI QIDQ680776

Jie Guo, Di Yan, Huijuan Lian, Zheng Huang, Weidong Qiu

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

zbMATH Keywords

mobile communication\(k\)-nearest neighbor (\(k\)-NN) searchlocation-based services (LBS)Moore curveprivate circular query protocol

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network protocols (68M12)

Uses Software

• HElib
• fhe
• SpaceTwist
• Casper*

Cites Work

• Advances in spatial and temporal databases. 10th international symposium, SSTD 2007, Boston, MA, USA, July 16--18, 2007. Proceedings
• Space-filling curves
• Fully homomorphic SIMD operations
• (Leveled) fully homomorphic encryption without bootstrapping
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Homomorphic Evaluation of the AES Circuit
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

This page was built for publication: Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service