Järvinen, Kimmo ; Kiss, Ágnes ; Schneider, Thomas ; Tkachenko, Oleksandr ; Yang, Zheng (2018)
Faster Privacy-Preserving Location Proximity Schemes.
17. International Conference on Cryptology And Network Security (CANS'18). Naples, Italy (30.09.2018-03.10.2018)
doi: 10.1007/978-3-030-00434-7_1
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2018 |
| Autor(en): | Järvinen, Kimmo ; Kiss, Ágnes ; Schneider, Thomas ; Tkachenko, Oleksandr ; Yang, Zheng |
| Art des Eintrags: | Bibliographie |
| Titel: | Faster Privacy-Preserving Location Proximity Schemes |
| Sprache: | Englisch |
| Publikationsjahr: | September 2018 |
| Ort: | Cham |
| Verlag: | Springer |
| Buchtitel: | Cryptology and Network Security |
| Veranstaltungstitel: | 17. International Conference on Cryptology And Network Security (CANS'18) |
| Veranstaltungsort: | Naples, Italy |
| Veranstaltungsdatum: | 30.09.2018-03.10.2018 |
| DOI: | 10.1007/978-3-030-00434-7_1 |
| URL / URN: | https://encrypto.de/papers/JKSTY18.pdf |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Engineering; E4 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Praktische Kryptographie und Privatheit DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche Profilbereiche Profilbereiche > Cybersicherheit (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CRISP - Center for Research in Security and Privacy DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen |
| Hinterlegungsdatum: | 11 Jul 2018 10:01 |
| Letzte Änderung: | 30 Jul 2024 10:49 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum