TU Darmstadt / ULB / TUbiblio

The Cost of Path Information: Routing in Anonymous Communication

Grube, Tim and Egert, Rolf and Daubert, Jörg and Mühlhäuser, Max (2021):
The Cost of Path Information: Routing in Anonymous Communication.
IEEE, Consumer Communications & Networking Conference (CCNC 2021), Virtual Conference, 09.-12.01., [Conference or Workshop Item]

Abstract

Anonymity is an essential asset for a variety of communication systems, like humans’ communication, the internet of things, and sensor networks. Establishing and maintaining such communication systems requires the exchange of information about their participants (called subjects). However, protecting anonymity reduces the availability of subject information, as these can be leveraged to break anonymity. Additionally, established techniques for providing anonymity often reduce the efficiency of communication networks. In this paper, we model four mechanisms to share routing information and discuss them with respect to their influence on anonymity and efficiency. While there is no “one fits all” solution, there are suitable trade-offs to establish routing information complying with the technical capabilities of the subjects. Distributed solutions like decentralized lookup tables reduce routing information in messages at the cost of local memory consumption; other mechanisms like multi-layer encrypted path information come with higher communication overhead but reduce memory consumption for each subject.

Item Type: Conference or Workshop Item
Erschienen: 2021
Creators: Grube, Tim and Egert, Rolf and Daubert, Jörg and Mühlhäuser, Max
Title: The Cost of Path Information: Routing in Anonymous Communication
Language: English
Abstract:

Anonymity is an essential asset for a variety of communication systems, like humans’ communication, the internet of things, and sensor networks. Establishing and maintaining such communication systems requires the exchange of information about their participants (called subjects). However, protecting anonymity reduces the availability of subject information, as these can be leveraged to break anonymity. Additionally, established techniques for providing anonymity often reduce the efficiency of communication networks. In this paper, we model four mechanisms to share routing information and discuss them with respect to their influence on anonymity and efficiency. While there is no “one fits all” solution, there are suitable trade-offs to establish routing information complying with the technical capabilities of the subjects. Distributed solutions like decentralized lookup tables reduce routing information in messages at the cost of local memory consumption; other mechanisms like multi-layer encrypted path information come with higher communication overhead but reduce memory consumption for each subject.

Publisher: IEEE
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Telecooperation
Event Title: Consumer Communications & Networking Conference (CCNC 2021)
Event Location: Virtual Conference
Event Dates: 09.-12.01.
Date Deposited: 13 Jan 2021 09:39
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details