Computer Science – Computer Science and Game Theory
Scientific paper
2009-08-04
Computer Science
Computer Science and Game Theory
Scientific paper
Scheideler has shown that peer-to-peer overlays networks can only survive Byzantine attacks if malicious nodes are not able to predict what is going to be the topology of the network for a given sequence of join and leave operations. In this paper we investigate adversarial strategies by following specific games. Our analysis demonstrates first that an adversary can very quickly subvert DHT-based overlays by simply never triggering leave operations. We then show that when all nodes (honest and malicious ones) are imposed on a limited lifetime, the system eventually reaches a stationary regime where the ratio of polluted clusters is bounded, independently from the initial amount of corruption in the system.
Anceaume Emmanuelle
Brasiliero F.
Ludinard R.
Sericola Bruno
Tronel F.
No associations
LandOfFree
Analytical Study of Adversarial Strategies in Cluster-based Overlays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Analytical Study of Adversarial Strategies in Cluster-based Overlays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analytical Study of Adversarial Strategies in Cluster-based Overlays will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-556761