LIPIcs.GIScience.2023.18.pdf
- Filesize: 3.86 MB
- 6 pages
Document
Anonymous Routing Using Minimum Capacity Clustering (Short Paper)
Authors
-
Part of:
Volume:
12th International Conference on Geographic Information Science (GIScience 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Geographic Information Science (GIScience) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-09-07
Cite AsGet BibTex
Maike Buchin and Lukas Plätz. Anonymous Routing Using Minimum Capacity Clustering (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 18:1-18:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.GIScience.2023.18
https://doi.org/10.4230/LIPIcs.GIScience.2023.18
Abstract
We present a framework which allows one to use an online routing service and get live updates without revealing the sensitive starting and ending points of one’s route. For that, we obfuscate the starting and ending locations in minimum capacity clusters and reveal only the route between these clusters. We compare different anonymous clustering strategies on positions in the network with efficient approximations and analyse the impact of the anonymisation on the route. We experimentally evaluate the effect of the anonymisation scheme in real-world settings.
Subject Classification
ACM Subject Classification
- Security and privacy → Pseudonymity, anonymity and untraceability
Keywords
- Anonymity
- approximation Algorithms
- directed Networks
- minimum capacity Clustering
- Privacy
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, and An Zhu. Achieving anonymity via clustering. ACM Trans. Algorithms, 6(3), 2010. URL: https://doi.org/10.1145/1798596.1798602.
- Amitai Armon. On min–max r-gatherings. Theoretical Computer Science, 412(7):573-582, 2011. Selected papers from WAOA 2007: Fifth Workshop on Approximation and Online Algorithms. URL: https://doi.org/10.1016/j.tcs.2010.04.040.
- Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes. Fast routing in road networks with transit nodes. Science, 316(5824):566-566, 2007. URL: https://doi.org/10.1126/science.1137521.
- Anna Brauer, Ville Mäkinen, Axel Forsch, Juha Oksanen, and Jan-Henrik Haunert. My home is my secret: concealing sensitive locations by context-aware trajectory truncation. International Journal of Geographical Information Science, 36(12):2496-2524, 2022. URL: https://doi.org/10.1080/13658816.2022.2081694.
- Jan-Henrik Haunert, Daniel Schmidt, and Melanie Schmidt. Anonymization via clustering of locations in road networks. In GIScience 2021 Short Paper Proceedings. UC Santa Barbara: Center for Spatial Studies., 2021. URL: https://doi.org/10.25436/E2CC7P.
- Latanya Sweeney. k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(05):557-570, 2002. URL: https://doi.org/10.1142/S0218488502001648.
- Statistische Ämter des Bundes und der Länder. Bevölkerung im 100 meter-gitter, 2018. URL: https://www.zensus2011.de/DE/Home/Aktuelles/DemografischeGrunddaten.html?nn=559100.