Efficient privacy-preserving spatial data query in cloud computing

• Main Authors: MIAO, Yinbin, YANG, Yutao, LI, Xinghua, WEI, Linfeng, LIU, Zhiquan, DENG, Robert H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2024
• Subjects: Cloud server; privacy-preserving; query range; security issues; spatial data; Information Security; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/8617; https://ink.library.smu.edu.sg/context/sis_research/article/9620/viewcontent/Eff_Privacy_Preser_TKDE_av.pdf
• Institution: Singapore Management University

With the rapid development of geographic location technology and the explosive growth of data, a large amount of spatial data is outsourced to the cloud server for reducing the local high storage and computing burdens, but at the same time causes security issues. Thus, extensive privacy-preserving spatial data query schemes have been proposed. Most of the existing schemes use Asymmetric Scalar-Product-Preserving Encryption (ASPE) to encrypt data, but ASPE has proven to be insecure against known plaintext attack. And the existing schemes require users to provide more information about query range and thus generate a large amount of ciphertexts, which causes high storage and computational burdens. To solve these issues, based on enhanced ASPE designed in our conference version, we first propose a basic Privacy-preserving Spatial Data Query (PSDQ) scheme by using a new unified index structure, which only requires users to provide less information about query range. Then, we propose an enhanced PSDQ scheme (PSDQ$+$+) by using Geohash-based $R$R-tree structure (called $GR$GR-tree) and efficient pruning strategy, which greatly reduces the query time. Formal security analysis proves that our schemes achieve Indistinguishability under Chosen Plaintext Attack (IND-CPA), and extensive experiments demonstrate that our schemes are efficient in practice.