The Lotus-Eater Attack
| dc.creator | Kash, Ian A. | |
| dc.creator | Friedman, Eric J. | |
| dc.creator | Halpern, Joseph Y. | |
| dc.date | 2008-06-10 | |
| dc.date.accessioned | 2026-07-07T12:19:27Z | |
| dc.date.available | 2026-07-07T12:19:27Z | |
| dc.description | Many protocols for distributed and peer-to-peer systems have the feature that nodes will stop providing service for others once they have received a certain amount of service. Examples include BitTorent's unchoking policy, BAR Gossip's balanced exchanges, and threshold strategies in scrip systems. An attacker can exploit this by providing service in a targeted way to prevent chosen nodes from providing service. While such attacks cannot be prevented, we discuss techniques that can be used to limit the damage they do. These techniques presume that a certain number of processes will follow the recommended protocol, even if they could do better by ``gaming'' the system. | |
| dc.identifier | https://arxiv.org/abs/0806.1711 | |
| dc.identifier | http://arxiv.org/abs/0806.1711 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212760 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | The Lotus-Eater Attack | |
| dc.type | text |