Secure Gossiping Techniques and Components

Gian Jesi, Ozalp Babao, Ozalp Babao
2007 unpublished
Gossip protocols have proved to be a viable solution to setup and manage large-scale P2P services or applications in a fully decentralised scenario. The gossip or epidemic communication scheme is heavily based on stochastic behaviors and it is the fundamental idea behind many large-scale P2P protocols. It provides many remarkable features, such as scalability, robustness to failures, emergent load balancing capabilities, fast spreading, and redundancy of information. In some sense, these
more » ... sense, these services or protocols mimic natural system behaviors in order to achieve their goals. The key idea of this work is that the remarkable properties of gossip hold when all the participants follow the rules dictated by the actual protocols. If one or more malicious nodes join the network and start cheating according to some strategy, the result can be catastrophic. In order to study how serious the threat posed by malicious nodes can be and what can be done to prevent attackers from cheating, we focused on a general attack model aimed to defeat a key service in gossip overlay networks (the Peer Sampling Service [JGKvS04]). We also focused on the problem of protecting against forged information exchanged in gossip services. We propose a solution technique for each problem; both techniques are general enough to be applied to distinct service implementations. As gossip protocols , our solutions are based on stochastic behavior and are fully decentralized. v In addition, each technique's behaviour is abstracted by a general primitive function extending the basic gossip scheme; this approach allows the adoptions of our solutions with minimal changes in different scenarios. We provide an extensive experimental evaluation to support the effectiveness of our techniques. Basically, these techniques aim to be building blocks or P2P architecture guidelines in building more resilient and more secure P2P services. vi Acknowledgements There are many people to thank for their support and throughout my Ph.D. Firstly, I would like to thank my supervisor, Prof. ¨ Ozalp Babao ˘ glu, who gave me the chance to discover the world of research. A special thanks to Alberto Montresor for his help and patience.