Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Query-flood DoS attacks in gnutella
Proceedings of the 9th ACM conference on Computer and communications security
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Taxonomy of trust: categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Taxonomy of trust: Categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Breaking the collusion detection mechanism of morphmix
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
| Hi-index | 0.00 |
This paper studies the problem of resource discovery in unstructured peer-to-peer (P2P) systems. We propose simple policies that make the discovery of resources resilient to coordinated attacks by malicious nodes. We focus on a novel P2P protocol called GUESS [8] that uses a pong cache, a set of currently known nodes, to discover new ones. We define a simple, abstract model of a GUESS network,and We describe how to limit pong cache poisoning, a condition in which the ids of malicious nodes appear in the pong caches of good nodes. We run simulations based on our model, and evaluate different options for the key decisions that nodes need to make.We propose an ID smearing algorithm (IDSA) and a dynamic network partitioning (DNP) scheme that can be used together to reduce the impact of malicious nodes. We also propose adding an introduction protocol (IP) as a basic mechanism to GUESS to ensure liveness. We suggest using a most-recently-used (MRU) cache replacement policy to slow down the rate of poisoning. Finally, we determine the marginal utility of using a malicious node detector (MND) to further limit poisoning, and the level of accuracy required of the detector.