License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.GIScience.2023.18
URN: urn:nbn:de:0030-drops-189131
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18913/
Buchin, Maike ;
Plätz, Lukas
Anonymous Routing Using Minimum Capacity Clustering (Short Paper)
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.
BibTeX - Entry
@InProceedings{buchin_et_al:LIPIcs.GIScience.2023.18,
author = {Buchin, Maike and Pl\"{a}tz, Lukas},
title = {{Anonymous Routing Using Minimum Capacity Clustering}},
booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)},
pages = {18:1--18:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-288-4},
ISSN = {1868-8969},
year = {2023},
volume = {277},
editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18913},
URN = {urn:nbn:de:0030-drops-189131},
doi = {10.4230/LIPIcs.GIScience.2023.18},
annote = {Keywords: Anonymity, approximation Algorithms, directed Networks, minimum capacity Clustering, Privacy}
}
