Abstract
Peer to Peer (P2P) is one of the most popular technology which paved a way to new structures in many applications including content searching, file sharing etc. On the other hand, inclusion of a few malicious peers, the entire network could be disrupted without proper security measures. This paper presents a very simple but an effective security mechanism for gossip based P2P networks. In the proposed protocol, each gossiping node observes its peers closely to ensure that no malicious nodes will actively participate in the gossip protocol. To achieve this, each peer builds trust information about other nodes in the system and exchanges with its neighbours. Using the trust information, each node is able to identify and blacklist malicious nodes in its view. Thus, each node gossips only with nodes it deems as non-malicious. The efficiency of the proposed protocol is far ahead of existing security protocols such as TooLate. Our simulation results show the effectiveness of the proposed work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rowstron, A., Druschel, P.: Pastry- Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of the 6th ACM Symposium on Principles of Distributing Computing (PODC 1987), pp. 1–12 (1987)
Montresor, A., Jelasity, M.: PeerSim: A scalable P2P simulator. In: IEEE Ninth International Conference, pp. 99–100 (2009)
Anceaume, E., Busnel, Y., Gambs, S.: Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 64–78. Springer, Heidelberg (2010)
Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: byzantine resilient random membership sampling. In: Proceedings of the twenty-seventh ACM Symposium on Principles of Distributed Computing (PODC 2008), Canada, pp. 145–154 (2008)
Jesi, G.P., Montresor, A., van Steen, M.: A Secure Peer Sampling. Computer Networks 54(12), 2086–2098 (2010)
Jesi, G.P., Hales, D., van Steen, M.: Identifying Malicious Peers Before its TooLate: A Decentralized Secure Peer Sampling Service. In: First International Conference on Self-Adaptive and Self-Organizing Systems (SASO), Boston, MA, USA, pp. 237–246 (2007)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord- A Scalable Peer-to-Peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. of the 32nd ACM Symposium on Theory of Computing (STOC 2000), pp. 163–170 (2000)
Jelasity, M., Montresor, A., Babaoglu, O.: A modular paradigm for building self-organizing peer-to-peer applications. In: Di Marzo Serugendo, G., Karageorgos, A., Rana, O.F., Zambonelli, F. (eds.) ESOA 2003. LNCS (LNAI), vol. 2977, pp. 265–282. Springer, Heidelberg (2004)
Jelasity, M., Montresor, A., Babaoglu, O.: The bootstrapping service. In: Proc. Of the 26th IEEE International Conference Workshops on Distributed Computing Systems (IDCSW 2006), pp. 11–16. IEEE Computer Society (2006)
Bertier, M., Bonnet, F., Kermarrec, A.M., Leroy, V., Peri, S., Raynal, M.: D2HT- The Best of Both Worlds, Integrating RPS and DHT. In: European Dependable Computing Conference, pp. 135–144 (2010)
Eugster, P.T., Guerraoui, R., Kermarrec, A.M., Massouli, L.: Epidemic information dissemination in distributed systems. IEEE Computer 37(5), 60–67 (2004)
Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proc. of the USENIX Annual Technical Conference, pp. 10–23. USENIX Association, Berkeley (2004)
Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 1143–1152. Springer, Heidelberg (2005)
Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon- Inexpensive membership management for unstructured P2P overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Tetarave, S.K., Tripathy, S., Peri, S. (2015). S-Gossip: Security Enhanced Gossip Protocol for Unstructured P2P Networks. In: Natarajan, R., Barua, G., Patra, M.R. (eds) Distributed Computing and Internet Technology. ICDCIT 2015. Lecture Notes in Computer Science, vol 8956. Springer, Cham. https://doi.org/10.1007/978-3-319-14977-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-14977-6_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14976-9
Online ISBN: 978-3-319-14977-6
eBook Packages: Computer ScienceComputer Science (R0)