Järvinen, Kimmo ; Kiss, Ágnes ; Schneider, Thomas ; Tkachenko, Oleksandr ; Yang, Zheng (2019):
Faster Privacy-Preserving Location Proximity Schemes for Circles and Polygons.
In: IET Information Security, DOI: 10.1049/iet-ifs.2019.0125,
[Article]
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 support both circle and polygon range queries and have runtimes from a few to some hundreds of milliseconds and bandwidth requirements from a few hundreds of bytes to one megabyte. Consequently, they are well-suited for different scenarios and offer faster runtimes and savings in bandwidth and computational power as well as security improvements compared to previous PPLP schemes. 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.
| Item Type: | Article |
|---|---|
| Erschienen: | 2019 |
| Creators: | Järvinen, Kimmo ; Kiss, Ágnes ; Schneider, Thomas ; Tkachenko, Oleksandr ; Yang, Zheng |
| Title: | Faster Privacy-Preserving Location Proximity Schemes for Circles and Polygons |
| Language: | English |
| 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 support both circle and polygon range queries and have runtimes from a few to some hundreds of milliseconds and bandwidth requirements from a few hundreds of bytes to one megabyte. Consequently, they are well-suited for different scenarios and offer faster runtimes and savings in bandwidth and computational power as well as security improvements compared to previous PPLP schemes. 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. |
| Journal or Publication Title: | IET Information Security |
| Uncontrolled Keywords: | Engineering; E4 |
| Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Cryptography and Privacy Engineering (ENCRYPTO) DFG-Collaborative Research Centres (incl. Transregio) DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres DFG-Graduiertenkollegs DFG-Graduiertenkollegs > Research Training Group 2050 Privacy and Trust for Mobile Users Profile Areas Profile Areas > Cybersecurity (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CRISP - Center for Research in Security and Privacy DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1119: CROSSING – Cryptography-Based Security Solutions: Enabling Trust in New and Next Generation Computing Environments |
| Date Deposited: | 18 Nov 2019 09:13 |
| DOI: | 10.1049/iet-ifs.2019.0125 |
| PPN: | |
| Corresponding Links: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum