Abstract
Nodes in route-restricted overlays have an im-mutable set of neighbors, explicitly specified by their users. Pop-ular examples include payment networks such as the Lightningnetwork as well as social overlays such as the Dark Freenet.Routing algorithms are central to such overlays as they enablecommunication between nodes that are not directly connected.Recent results show that algorithms based on spanning treesare the most promising provably efficient choice. However, allsuggested solutions fail to address how distributed spanning treealgorithms can deal with active denial of service attacks bymalicious nodes.In this work, we design a novel self-stabilizing spanning treeconstruction algorithm that utilizes cryptographic signatures andprove that it reduces the set of nodes affected by active attacks.Our simulations substantiate this theoretical result withconcretevalues based on real-world data sets. In particular, our resultsindicate that our algorithm reduces the number of affectednodes by up to 74% compared to state-of-the-art attack-resistantspanning tree constructions
Original language | English |
---|---|
Title of host publication | Proceedings - 2019 IEEE 38th International Symposium on Reliable Distributed Systems, SRDS 2019 |
Pages | 251-260 |
Number of pages | 10 |
ISBN (Electronic) | 0769567118, 9781728142227 |
DOIs | |
Publication status | Published - Oct 2019 |
Event | 38th Symposium on Reliable Distributed Systems - Lyon, France Duration: 1 Oct 2019 → 4 Oct 2019 Conference number: 38 |
Publication series
Name | Proceedings of the IEEE Symposium on Reliable Distributed Systems |
---|---|
ISSN (Print) | 1060-9857 |
Conference
Conference | 38th Symposium on Reliable Distributed Systems |
---|---|
Abbreviated title | SRDS 2019 |
Country/Territory | France |
City | Lyon |
Period | 1/10/19 → 4/10/19 |
Keywords
- Attack resistance
- Availability
- Route restricted overlays
- Spanning tree construction
- Sybil attacks