N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Asynchrony and collusion in the n-party BAR transfer problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Cachet: a decentralized architecture for privacy preserving social networking with caching
Proceedings of the 8th international conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
Gossip protocols are an efficient and reliable way to disseminate information. These protocols have nevertheless a drawback: they are unable to limit the dissemination of spam messages. Indeed, messages are redundantly disseminated in the network and it is enough that a small subset of nodes forward spam messages to have them received by a majority of nodes. In this paper, we present Fire Spam, a gossiping protocol that is able to limit spam dissemination. Fire Spam organizes nodes in a ladder topology, where nodes highly capable of filtering spam are at the top of the ladder, whereas nodes with a low spam filtering capability are at the bottom of the ladder. Messages are disseminated from the bottom of the ladder to its top. The ladder does thus act as a progressive spam filter. In order to make it usable in practice, we designed Fire Spam in the BAR model. This model takes into account selfish and malicious behaviors. We evaluate Fire Spam using simulations. We show that it drastically limits the dissemination of spam messages, while still ensuring reliable dissemination of good messages.