Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Exploiting P2P systems for DDoS attacks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
ACM Transactions on Computer Systems (TOCS)
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Veracity: a fully decentralized service for securing network coordinate systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Proximity-aware superpeer overlay topologies
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
A taxonomy of rational attacks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
Assessing data availability of Cassandra in the presence of non-accurate membership
Proceedings of the 2nd International Workshop on Dependability Issues in Cloud Computing
| Hi-index | 0.00 |
Gossiping has been identified as a useful building block for the development of large-scale, decentralized collaborative systems. With gossiping, individual nodes periodically interact with random partners, exchanging information about their local state; yet, they may globally provide several useful services, such as information diffusion, topology management, monitoring, load-balancing, etc. One fundamental building block for developing gossip protocols is peer sampling, which provides nodes with the ability to sample the entire population of nodes in order to randomly select a gossip partner. In existing implementations, however, one fundamental aspect is neglected: security. Byzantine nodes may subvert the peer sampling service and bias the random selection process, for example, by increasing the probability that a fellow malicious node is selected instead of a random one. The contribution of this paper is an extension to existing peer sampling protocols with a detection mechanism that identifies and blacklists nodes that are suspected of behaving maliciously. An extensive experimental evaluation shows that our extension is efficient in dealing with a large number of malicious nodes.