Privacy-preserving arbitrary geometric range query in mobile Internet of Vehicles

• Main Authors: MIAO, Yinbin, SONG, Lin, LI, Xinghua, LI, Hongwei, CHOO, Kim-Kwang Raymond, DENG, Robert H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2023
• Subjects: Access pattern; Cloud computing; dual-server model; Encryption; geometric range query; Mobile computing; spatial data query; Information Security; Transportation
• Online Access: https://ink.library.smu.edu.sg/sis_research/8482; https://ink.library.smu.edu.sg/context/sis_research/article/9485/viewcontent/Privacy_Preserving_AGR_IoV_av.pdf
• Institution: Singapore Management University

The mobile Internet of Vehicles (IoVs) has great potential for intelligent transportation, and creates spatial data query demands to realize the value of data. Outsourcing spatial data to a cloud server eliminates the need for local computation and storage, but it leads to data security and privacy threats caused by untrusted third-parties. Existing privacy-preserving spatial range query solutions based on Homomorphic Encryption (HE) have been developed to increase security. However, in the single server model, the private key is held by the query user, which incurs high computation and communication burdens on query users due to multiple rounds of interactions. Moreover, exposing data access patterns to semi-honest servers is highly vulnerable to frequency and statistical attacks. To solve these issues, in this paper we propose a secure spatial location query within arbitrary geometric range while protecting access pattern. Specifically, we apply Paillier algorithm and polynomial fitting technique to achieve secure arbitrary geometric range query, design secure and efficient search protocol to hide data access patterns and alleviate query users from high computation and communication burdens under dual-server model. Formal security analysis shows that our scheme is secure under semi-honest model, and extensive experiments demonstrate that our work can reduce users' communication costs by more than 90% compared to previous schemes under single server model, which is practice in real-world scenarios.