Malicious Behaviour in Content-Addressable Peer-to-Peer Networks

3rd Annual Communication Networks and Services Research Conference (CNSR'05) pp. 319-326
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Thomas Reidemeister, University of Magdeburg
Klemens Bohm, University of Karlsruhe
Paul A. S. Ward, University of Waterloo
Erik Buchmann, University of Magdeburg

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CNSR.2005.39
Send link to a friend

Abstract
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A critical challenge when designing a CAN, or indeed any DHT, is ensuring that all data items are accessible despite the presence of malicious and faulty peers. Such peers may hinder other peers in accessing the keys in various ways. In this paper we identify various types of attacks and propose, where possible, some countermeasures. To counter man-in-the-middle attacks we have developed a dynamically-adjustable multi-path routing algorithm. We evaluate the efficacy of our method both analytically and by simulation. For networks with less than 1% malicious peers we were able to reduce the effect of such attacks by 80%.
Back to Top Additional Information
Index Terms- networking, malicious behaviour, CAN, attacks, DHT Citation: Thomas Reidemeister, Klemens Bohm, Paul A. S. Ward, Erik Buchmann, "Malicious Behaviour in Content-Addressable Peer-to-Peer Networks," cnsr, pp. 319-326, 3rd Annual Communication Networks and Services Research Conference (CNSR'05), 2005

	Advanced Search
CS Search Google Search