Go to DBLP homepageEfficient and Privacy-Preserving Weighted Nearby-Fit Spatial Keyword Query in Cloud
Abstract: In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this article, we introduce an efficient and privacy-preserving scheme called the privacy-preserving weighted nearby-fit spatial keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree-based weighted nearby-fit spatial keyword (WNSK) query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness.
External IDs:dblp:journals/iotj/SunLZZT25
Loading