Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Communications of the ACM
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Pyramid: Building Incentive Architecture for Unstructured Peer-to-Peer Network
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Taxonomy of trust: Categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
| Hi-index | 0.00 |
This paper discusses how to secure overlay activities of peers on overlay level messages exchanged in unstructured P2P networks. We identify some attacks that can be effectively handled by appropriate cryptographic means. We then give a detection method against those attacks including message modification, replay attack, and message generation with wrong information. The method presumes the existence of a set of CAs, which are consulted when peers are newly joining the network and otherwise uninvolved in the peer activities. We also address the attack of a peer's illegal dropping of relaying messages, which is hard to be traced to its doer even with the assist of cryptographic means. We propose an audit and topology adaptation technique to confine and weaken the ill effect of such an attack on other peers in the network. We demonstrate the effectiveness of the technique using a modified GnutellaSim [14] simulator with respect to various metrics. Being based upon a generic overlay model, the proposed techniques can be applied to any unstructured P2P network either separately or all together.