Cryptology ePrint Archive: Report 2018/694

Faster Privacy-Preserving Location Proximity Schemes

Kimmo Järvinen and Ágnes Kiss and Thomas Schneider and Oleksandr Tkachenko and Zheng Yang

Abstract: In the last decade, location information became easily obtainable using off-the-shelf mobile devices. This gave a momentum to developing Location Based Services (LBSs) such as location proximity detection, which can be used to find friends or taxis nearby. LBSs can, however, be easily misused to track users, which draws attention to the need of protecting privacy of these users.

In this work, we address this issue by designing, implementing, and evaluating multiple algorithms for Privacy-Preserving Location Proximity (PPLP) that are based on different secure computation protocols. Our PPLP protocols are well-suited for different scenarios: for saving bandwidth, energy/computational power, or for faster runtimes. Furthermore, our algorithms have runtimes of a few milliseconds to hundreds of milliseconds and bandwidth of hundreds of bytes to one megabyte. In addition, the computationally most expensive parts of the PPLP computation can be precomputed in our protocols, such that the input-dependent online phase runs in just a few milliseconds.

Category / Keywords: applications / Location Privacy, Proximity, Secure Computation, Homomorphic Encryption

Original Publication (with minor differences): CANS'18

Date: received 19 Jul 2018, last revised 23 Jul 2018

Contact author: tkachenko at encrypto cs tu-darmstadt de

Available format(s): PDF | BibTeX Citation

Version: 20180723:111649 (All versions of this report)

Short URL: ia.cr/2018/694


[ Cryptology ePrint archive ]