Cryptology ePrint Archive: Report 2020/1394

Practical and Secure Circular Range Search on Private Spatial Data

Zhihao Zheng and Jiachen Shen and Zhenfu Cao

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.

Category / Keywords: secret-key cryptography / spatial data, cloud server, circular range search, index privacy, query privacy.

Original Publication (with minor differences): IEEE TrustCom 2020

Date: received 8 Nov 2020

Contact author: 1779976538 at qq com

Available format(s): PDF | BibTeX Citation

Version: 20201110:125606 (All versions of this report)

Short URL: ia.cr/2020/1394


[ Cryptology ePrint archive ]