Attacking the kad network—real world evaluation and high fidelity simulation using DVN

Wang, Peng; Tyra, James; Chan-Tin, Eric; Malchow, Tyson; Kune, Denis Foo; Hopper, Nicholas; Kim, Yong‐Dae

doi:10.1002/sec.172

Cited by 7 publications

(4 citation statements)

References 24 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The security Kademlia [7] and its inspired implementations have been studied extensively [10], [19]- [21]. Steiner et al [19] explore the space of possible attacks and implications whereas subsequent works focus on optimizations of these attacks [10], [21] and circumventing implemented countermeasures [20]. Most approaches require the ability to arbitrarily choose node IDs.…”

Section: B Attacks On Kademlia-based Networkmentioning

confidence: 99%

“…Most approaches require the ability to arbitrarily choose node IDs. Similar to our false friend attack where we insert carefully selected node IDs into the victim's discovery table, [21] present a low-resource approach to poison routing entries in the KAD network. Given multiple attacking nodes, the ID space is partitioned and routing entries hijacked by spoofing messages.…”

Section: B Attacks On Kademlia-based Networkmentioning

confidence: 99%

See 1 more Smart Citation

Eclipsing Ethereum Peers with False Friends

Henningsen

Teunis

Florian

et al. 2019

2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)

View full text Add to dashboard Cite

Ethereum is a decentralized Blockchain system that supports the execution of Turing-complete smart contracts. Although the security of the Ethereum ecosystem has been studied in the past, the network layer has been mostly neglected. We show that Go Ethereum (Geth), the most widely used Ethereum implementation, is vulnerable to eclipse attacks, effectively circumventing recently introduced security enhancements. 1 . Our false friends attack exploits the Kademlia-inspired peer discovery logic used by Geth and enables a low-resource eclipsing of longrunning, remote victim nodes. An adversary only needs two hosts in distinct /24 subnets to launch the eclipse, which can then be leveraged to filter the victim's view of the Blockchain. We discuss fundamental properties of Geth's node discovery logic that enable the false friends attack, as well as proposed and implemented countermeasures.

show abstract

Section: B Attacks On Kademlia-based Networkmentioning

confidence: 99%

Section: B Attacks On Kademlia-based Networkmentioning

confidence: 99%

Eclipsing Ethereum Peers with False Friends

Henningsen

Teunis

Florian

et al. 2019

2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)

View full text Add to dashboard Cite

show abstract

“…We should have full control of these two aspects in a simulator: we have considered the few available KAD simulators [34] [35], and none of them provides such control. For this reason we decided to implement a custom event-driven simulator [36].…”

Section: Simulator Description and Settingsmentioning

confidence: 99%

Characterization and Management of Popular Content in KAD

Carra

Steiner²,

Michiardi

et al. 2013

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Armed with the insights gained from an extensive measurement campaign, we pinpoint several deficiencies of the present KAD design in handling popular content, and provide a series of solutions to address such shortcomings. Among them, we design and evaluate an adaptive load balancing mechanism. Our mechanism is backward compatible with KAD, as it only modifies its inner algorithms, and presents several desirable properties: (i) it drives the process that selects the number and location of peers responsible to store references to objects, based on their popularity; (ii) it solves problems related to saturated peers, that would otherwise entail a significant drop in the diversity of references to objects, and (iii) if coupled with an enhanced content search procedure, it allows a more fair and efficient usage of peer resources, at a reasonable cost. Our evaluation uses a trace-driven simulator that features realistic peer churn and a precise implementation of the inner components of KAD.

show abstract

“…We should have full control on these two aspects in a simulator: we have considered the few available KAD simulators [12] [19] and none of them provides such control. For this reason we decided to implement a custom event driven simulator [7].…”

Section: A Simulator Description and Settingsmentioning

confidence: 99%

Adaptive load balancing in KAD

Carra

Steiner²,

Michiardi

2011

2011 IEEE International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

Abstract-The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Armed with the insights gained from an extensive measurement campaign, which pinpoints several deficiencies of the present KAD design in handling popular objects, we set off to design and evaluate an adaptive load balancing mechanism. Our mechanism is backward compatible with KAD, as it only modifies its inner algorithms, and presents several desirable properties: (i) it drives the process that selects the number and location of peers responsible to store references to objects, based on their popularity; (ii) it solves problems related to saturated peers, that entail a significant drop in the diversity of references to objects, and (iii) if coupled with an enhanced content search procedure, it allows a more fair and efficient usage of peer resources, at a reasonable cost. Our evaluation uses a trace-driven simulator that features realistic peer churn and a precise implementation of the inner components of KAD.

show abstract

Attacking the kad network—real world evaluation and high fidelity simulation using DVN

Cited by 7 publications

References 24 publications

Eclipsing Ethereum Peers with False Friends

Eclipsing Ethereum Peers with False Friends

Characterization and Management of Popular Content in KAD

Adaptive load balancing in KAD

Contact Info

Product

Resources

About