Universal location referencing and homomorphic evaluation of geospatial query

6Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Location data reveals users’ trajectories, yet it is often shared to enable many location-based services (LBS). In this paper, we propose a privacy-preserving geospatial query system with geo-hashing and somewhat homomorphic encryption. We geo-hash locations using space-filling curves for locality-preserving dimension reduction, which allows the users to specify granularity preference of their location and is agnostic to specific maps or precoded location models. Our system features three homomorphic algorithms to compute geospatial queries on encrypted location data and encrypted privacy preferences. Comparing with previous work, one of our algorithms reduces the multiplicative depth of a basic homomorphic computation approach by more than half, which significantly speeds it up. We then present an optimized prototype and experimentally demonstrates its utility in spatial cloaking.

Cite

CITATION STYLE

APA

Aloufi, A., Hu, P., Liu, H., Chow, S. S. M., & Choo, K. K. R. (2021). Universal location referencing and homomorphic evaluation of geospatial query. Computers and Security, 102. https://doi.org/10.1016/j.cose.2020.102137

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free