2026-07-24T06:34:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18913 2024-03-06T11:02:57Z ddc:004 open_access

Anonymous Routing Using Minimum Capacity Clustering (Short Paper) Buchin, Maike Plätz, Lukas Anonymity approximation Algorithms directed Networks minimum capacity Clustering Privacy 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Maike Buchin and Lukas Plätz 2023 Is Part Of LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GIScience.2023.18 urn:nbn:de:0030-drops-189131 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.18 eng https://creativecommons.org/licenses/by/4.0/legalcode