Publikationen

Autor	Järvinen, Kimmo; Kiss, Ágnes; Schneider, Thomas; Tkachenko, Oleksandr; Yang, Zheng
Datum	2018
Art	Conference Proceedings
Abstrakt	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.
Konferenz	17. International Conference on Cryptology And Network Security (CANS'18)
In	Cryptology and Network Security, p.3-22
Publisher	Springer
Url	https://tubiblio.ulb.tu-darmstadt.de/id/eprint/106138

Faster Privacy-Preserving Location Proximity Schemes