DeepAI AI Chat
Log In Sign Up

Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings

by   Martin Byrenheid, et al.
TU Dresden
Delft University of Technology

Due to its high efficiency, routing based on greedy embeddings of rooted spanning trees is a promising approach for dynamic, large-scale networks with restricted topologies. Friend-to-friend (F2F) overlays, one key application of embedding-based routing, aim to prevent disclosure of their participants to malicious members by restricting exchange of messages to mutually trusted nodes. Since embeddings assign a unique integer vector to each node that encodes its position in a spanning tree of the overlay, attackers can infer network structure from knowledge about assigned vectors. As this information can be used to identify participants, an evaluation of the scale of leakage is needed. In this work, we analyze in detail which information malicious participants can infer from knowledge about assigned vectors. Also, we show that by monitoring packet trajectories, malicious participants cannot unambiguously infer links between nodes of unidentified participants. Using simulation, we find that the vector assignment procedure has a strong impact on the feasibility of inference. In F2F overlay networks, using vectors of randomly chosen numbers for routing decreases the mean number of discovered individuals by one order of magnitude compared to the popular approach of using child enumeration indexes as vector elements.


page 1

page 2

page 3

page 4


Rainbow spanning trees in randomly coloured G_k-out

Given a graph G=(V,E) on n vertices and an assignment of colours to its ...

Security in Distributed Systems by Verifiable Location-Based Identities

Proof-of-Location (PoL) is a lightweight security concept for Internet-o...

On the Limits of Byzantine-tolerant Spanning Tree Construction in Route-Restricted Overlay Networks

Route-restricted overlays are peer-to-peer networks where each node can ...

Resolving the Decreased Rank Attack in RPL's IoT Networks

The Routing Protocol for Low power and Lossy networks (RPL) has been dev...

Independent Spanning Trees in Eisenstein-Jacobi Networks

Spanning trees are widely used in networks for broadcasting, fault-toler...

Self-healing Routing and Other Problems in Compact Memory

This paper looks at the question of designing distributed algorithms for...

Genet: A Quickly Scalable Fat-Tree Overlay for Personal Volunteer Computing using WebRTC

WebRTC enables browsers to exchange data directly but the number of poss...