marti-social - DHT Routing Using Social Links Sergio Marti,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: DHT Routing Using Social Links Sergio Marti, Prasanna Ganesan and Hector Garcia-Molina Stanford University { smarti, prasanna, hector } @cs.stanford.edu Abstract The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existing social networks can benefit P2P networks by leveraging the inherent trust associated with social links. We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks. We propose SPROUT, a DHT routing algorithm that significantly increases the probability of successful routing by using social links. Finally, we discuss further optimization and design choices for both the model and the routing algorithm. I. I NTRODUCTION Because of the anonymity of peers and the lack of a centralized enforcement agency, P2P systems are especially vulnerable to a category of attacks we call misrouting attacks. We use the term misrouting to refer to any failure by a node to forward a message to the ap- propriate peer according to the correct routing algorithm. This includes dropping the message or forwarding the message to other colluding nodes instead of the correct peer, perhaps in an attempt to control the results of a query. A malicious node may wish to masquerade as the index owner of the key being queried for in order to disseminate bad information and suppress content shared by other peers. In addition, malicious users can acquire several valid network identifiers and thus control multiple dis- tinct nodes in the network. This is referred to as the Sybil attack and has been studied by various groups (e.g. [4] [3] [7]). This implies that a small number of ma- licious users can control a large fraction of the network nodes, increasing the probability that they participate in any given message route. To avoid routing messages through possibly malicious nodes, we would prefer forwarding our messages through nodes controlled by people we know personally, perhaps from a real life social context. We could most likely assume our friends would not purposefully misroute our messages. 1 Likewise, our friends could try and forward our message through their friends nodes. This would require a mechanism to identify who our social contacts are and locate them in the network when they are online. Fortunately, this mechanism already exists in the form of various social network services. AOL, Microsoft, and Yahoo! all provide instant messaging services to millions of users, alerting them when their friends log on. Many websites, like Friendster, specialize in creating and utilizing social networks. We propose building peer- to-peer networks which leverage these existing social network services to establish additional, highly trusted, links at little additional cost. To determine the value of such a system we need a new way of modelling social trust and how it translates to the chance of misrouting.trust and how it translates to the chance of misrouting....
View Full Document

Page1 / 6

marti-social - DHT Routing Using Social Links Sergio Marti,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online