Daswani, Neil and Garcia-Molina, Hector (2003) Pong-Cache Poisoning in GUESS (Extended Technical Report). Technical Report. Stanford.
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 that uses a pong cache, a set of currently known nodes, to discover new ones. 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 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, and an ID smearing algorithm (IDSA) to limit poisoning in the steady-state. We also determine the marginal utility of using a malicious node detector (MND) to further limit poisoning, and the level of accuracy required of the detector.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||peer-to-peer, security|
|Subjects:||Computer Science > Distributed Systems|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/peers/|
|Deposited By:||Import Account|
|Deposited On:||31 Jul 2003 17:00|
|Last Modified:||24 Dec 2008 09:33|
Repository Staff Only: item control page