Efficient Privacy-Preserving Geographic Keyword Boolean Range Query Over Encrypted Spatial Data

doi:10.1109/JSYST.2022.3183153

Efficient Privacy-Preserving Geographic Keyword Boolean Range Query Over Encrypted Spatial Data

2023-03-01

10

PRE

AI

DOI：10.1109/JSYST.2022.3183153

Original

Original request for help

Save

Abstract

En 中文

With the widespread popularity of mobile devices and geolocation-related services, spatial keyword data has exploded in recent years. As an application, people are accustomed to using specific keywords to search for data in a given geometric range. To protect user privacy, searchable encryption technologies are used to encrypt data and user queries. Most existing works focus on either spatial attributes or keyword attributes over encrypted spatial keyword data, which cannot solve the problem of geographic keyword range queries directly. And several other works considering these two attributes have some limitations in terms of query efficiency and security assurance. In this article, we propose an efficient privacy-preserving geographic keyword Boolean range query (EPBRQ) scheme to solve existing challenges in the current work. In particular, we design a recoding algorithm to break the limits of the current work to achieve lower time complexity and employ secure Knn computation to protect user data privacy comprehensively. The security analysis shows that our solution can well protect the privacy of data and queries from cloud server threats. And numerous experiments based on real-world data also show that our scheme provides better query efficiency than existing works.

Keywords:

Servers

Data privacy

Encryption

Spatial databases

Reflective binary codes

Indexes

Privacy

Geographic keyword range queries

privacy-preserving

searchable encryption

Efficient Privacy-Preserving Geographic Keyword Boolean Range Query Over Encrypted Spatial Data

Abstract

Journal

Organization