Secure routing for structured peer-to-peer overlay networks

By Miguel Oom Temudo de Castro, Peter Druschel, Ayalvadi J. Ganesh, Antony Ian Taylor Rowstron, D. Wallach. USENIX Symposium on Operating Systems Design and Implementation, 2002

930 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f48a3fc4ae93cb5aee3f179b81f8dacf63896cad

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

A Survey of Solutions to the Sybil Attack (2006, background): “• Resource testing [4, 15,19,33,38,41,51,55,56,59,61,67,87,93,95] The goal of resource testing is to attempt to determine if a number of identities possess fewer resources than would be expected if they were independent.”
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks (2005, background): “Readers may refer to [2, 18, 7] for a detailed discussion on security issues in overlay networks.”
Low-resource routing attacks against tor (2007, background): “Secure routing based on proximity awareness has been proposed in peer-to-peer networks [3].”
A survey of attack and defense techniques for reputation systems (2009, methodology): “anisms [51] and data replication mechanisms [52] must be employed to ensure that requests are successfully performed.”
BotGrep: Finding P2P Bots with Structured Graph Analysis (2010, background): “Finally, structured overlay networks also have protection mechanisms against active attacks [12].”
KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing (2003, methodology): “KARMA maintains its internal state in p2p fashion, distributed across the participants, and employs the secure routing primitive [4] for reliable delivery of messages.”
Glacier: highly durable, decentralized storage despite massive correlated failures (2005, background): “This can be ensured though the use of certified node identifiers [10].”
Eluding carnivores: file sharing with strong anonymity (2004, background): “Note that that using a central point of entry and money in exchange for a node ID, as advocated in [1], would not impact the system except to simplify its implementation – exchanging money for a place on the ring is not fundamentally different from exchanging computational power, as it is also subje”
SybilInfer: Detecting Sybil Nodes using Social Networks (2009, background): “Centralised defences assume the existence of an authority that is capable of doing admission control for the network [3].”
A Survey of Peer-to-Peer Security Issues (2002, background): “[5], but are outlined here.”
Taxonomy of trust: Categorizing P2P reputation systems (2006, background): “Byzantine protocols, for example, assume less than a third of the peers are misbehaving [18] .”
Vanish: Increasing Data Privacy with Self-Destructing Data (2009, background): “, certified identities [26] and periodic cryptographic puzzles [9] for defense against Sybil attacks and various other defenses against Eclipse attacks [14, 51].”
Towards a Common API for Structured Peer-to-Peer Overlays (2003, methodology): “local lookup translates into a simple lookup of Pastry’s routing table; if safe is true, the lookup is performed in Pastry’s constrained routing table [1].”
Eclipse Attacks on Overlay Networks: Threats and Defenses (2006, background): “[5] propose the use of a routing failure test and redundant routing to improve the chance of successful routing.”