Updatable privacy-preserving -nearest neighbor query in location-based s-ervice

Area of Science:

• Computer Science
• Information Security
• Location-Based Services

Background:

• k-nearest neighbor (k-NN) queries are vital for location-based services (LBS), offering features like interest recommendations.
• Existing privacy schemes for k-NN queries often neglect the protection of stored location data or lack update functionality.
• The increasing reliance on LBS necessitates robust privacy solutions for user location data.

Purpose of the Study:

• To develop an updatable and privacy-preserving k-NN query scheme for location-based services.
• To address the limitations of existing schemes regarding the privacy of stored location points and data updates.
• To enhance the security and usability of location-based services.

Main Methods:

• Utilizes a k-Dimensional tree (k-D tree) for efficient storage of location points.
• Employs a distributed double-trapdoor public-key cryptosystem for encrypting location data.
• Leverages Ciphertext Comparison and Euclidean Distance Calculation Protocols for privacy-preserving operations.

Main Results:

• The proposed scheme effectively protects the privacy of both location data and query contents.
• It successfully supports the addition of new location points to a fixed location service provider.
• Experimental results demonstrate high query accuracy, exceeding 95%.

Conclusions:

• The developed scheme offers a significant advancement in privacy-preserving k-NN queries for LBS.
• It provides a practical solution for scenarios requiring secure and updatable location data management.
• The scheme enhances user trust and data security in location-based applications.