Improvements To The Secure Construction And Utilization Of Greedy Embeddings In Friend-To-Friend Overlays
Martin Byrenheid (Technische Universität Dresden)
S. Roos (TU Delft - Data-Intensive Systems)
Thorsten Strufe (Karlsruhe Institut für Technologie)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Routing based on greedy network embeddings enables efficient and privacypreserving routing in overlays where connectivity is restricted to mutually trusted nodes. In previous works, we proposed security enhancements to the embedding and routing procedures to protect against denial-of-service attacks by malicious overlay participants. In this work, we propose an improved timeout scheme to reduce the stabilization overhead of secure tree maintenance in response to node failures and malicious behavior. Furthermore, we present an attack-resistant packet replication scheme that leverages alternative paths discovered during routing