• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Secure routing for structured peer-to-peer overlay networks (2002)

Cached

  • Download as a PDF

Download Links

  • [www.comp.nus.edu.sg]
  • [www.ece.purdue.edu]
  • [www.eecs.harvard.edu]
  • [ftp.research.microsoft.com]
  • [www.cs.kent.edu]
  • [www.cs.kent.edu]
  • [www.cs.kent.edu]
  • [www.ovmj.org]
  • [www.cs.rice.edu]
  • [www.mpi-sws.mpg.de]
  • [www.mpi-sws.org]
  • [www.mpi-sws.org]
  • [www.cs.cornell.edu]
  • [www.cs.rice.edu]
  • [www.cs.ucsb.edu]
  • [www.cs.ucsb.edu]
  • [www.eecs.harvard.edu]
  • [cs.ucsb.edu]
  • [www.eecs.harvard.edu]
  • [web.eecs.umich.edu]
  • [www.eecs.harvard.edu]
  • [cs.ucsb.edu]
  • [web.eecs.umich.edu]
  • [research.microsoft.com]
  • [www.cs.rice.edu]
  • [research.microsoft.com]
  • [www2.cs.uh.edu]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [www2.cs.uh.edu]
  • [research.microsoft.com]
  • [rodin.cs.uh.edu]
  • [www.eecs.harvard.edu]
  • [www.maths.bris.ac.uk]
  • [www.csd.uoc.gr]
  • [www.cs.toronto.edu]
  • [rodin.cs.uh.edu]
  • [www.eecs.harvard.edu]
  • [people.maths.bris.ac.uk]
  • [www.csd.uoc.gr]
  • [www.freepastry.org]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Miguel Castro , Peter Druschel , Ayalvadi Ganesh , Antony Rowstron , Dan S. Wallach
Citations:473 - 12 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Castro02securerouting,
    author = {Miguel Castro and Peter Druschel and Ayalvadi Ganesh and Antony Rowstron and Dan S. Wallach},
    title = {Secure routing for structured peer-to-peer overlay networks},
    booktitle = {},
    year = {2002},
    pages = {299--314}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Structured peer-to-peer overlay networks provide a sub-strate for the construction of large-scale, decentralized applications, including distributed storage, group com-munication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This prob-lem is particularly serious in open peer-to-peer systems, where many diverse, autonomous parties without pre-existing trust relationships wish to pool their resources. This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks. We describe and eval-uate techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes. 1

Keyphrases

peer-to-peer overlay network    correct message delivery    malicious node    network partition    eval-uate technique    pre-existing trust relationship    content distribution    group com-munication    current overlay    many diverse    small fraction    present defense    node crash    large fraction    paper study attack    open peer-to-peer system    structured peer-to-peer overlay    autonomous party    decentralized application   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University