Updatable privacy-preserving -nearest neighbor query in location-based s-ervice
Related Experiment Video
Updated: Oct 7, 2025

Author Spotlight: UAV Remote Sensing for Efficient Invasive Plant Biomass Estimation
Published on: February 9, 2024
Songyang Wu1, Wenju Xu1, Zhiyong Hong2
1The State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, 710071 China.
Abstract:
The -nearest neighbor ( -NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of -NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving -NN query scheme to address the above two issues. Concretely, our scheme utilizes the D-tree ( -Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.
Related Concept Videos
Selected Data About Geographic Locations
Field Application of Global Positioning System
Types of Global Positioning System Surveys
Design Example: Identifying the Locations of Monuments in the Field Using Global Positioning System Device
Levels of Use of a GIS
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...

