| Title | Practical and Secure Circular Range Search on Private Spatial Data |
| Publication Type | Conference Paper |
| Year of Publication | 2020 |
| Authors | Zheng, Zhihao, Cao, Zhenfu, Shen, Jiachen |
| Conference Name | 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) |
| Keywords | circular range search, cloud server, Computing Theory, Computing Theory and Privacy, data privacy, Encryption, index privacy, Indexes, privacy, pubcrawl, query privacy, Resiliency, search problems, Servers, spatial data, Spatial databases |
| Abstract | With the location-based services (LBS) booming, the volume of spatial data inevitably explodes. In order to reduce local storage and computational overhead, users tend to outsource data and initiate queries to the cloud. However, sensitive data or queries may be compromised if cloud server has access to raw data and plaintext token. To cope with this problem, searchable encryption for geometric range is applied. Geometric range search has wide applications in many scenarios, especially the circular range search. In this paper, a practical and secure circular range search scheme (PSCS) is proposed to support searching for spatial data in a circular range. With our scheme, a semi-honest cloud server will return data for a given circular range correctly without uncovering index privacy or query privacy. We propose a polynomial split algorithm which can decompose the inner product calculation neatly. Then, we define the security of our PSCS formally and prove that it is secure under same-closeness-pattern chosen-plaintext attacks (CLS-CPA) in theory. In addition, we demonstrate the efficiency and accuracy through analysis and experiments compared with existing schemes. |
| DOI | 10.1109/TrustCom50675.2020.00090 |
| Citation Key | zheng_practical_2020 |
Practical and Secure Circular Range Search on Private Spatial Data