Skip to main content
Log in

Game-theoretic strategies for IDS deployment in peer-to-peer networks

  • Published:
Information Systems Frontiers Aims and scope Submit manuscript

Abstract

This work studies the problem of optimal positioning of Intrusion Detection Systems (IDSs) in a Peer-to-Peer (P2P) environment involving a number of peers and super-peers. This scenario applies to network architectures like that of Gnutella, Skype or Tor, which involve a huge number of leaf-peers and a selected number of super-peers who have higher responsibilities in the network. A malicious entity may become part of the P2P network by joining from any part of the network. It can attack a super-peer and thus disrupt the functioning of the P2P network. Peers may try to secure the network by running IDSs at certain strategically-chosen locations in the network. But a deterministic schedule of running and positioning the IDSs can be observed and thwarted by an adversary. In this paper, we explore the problem of strategically positioning IDSs in a P2P network with a randomized, game-theoretic approach. Our approach distributes the responsibility of running the IDSs between the peers in a randomized fashion and minimizes the probability of a successful attack.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Notes

  1. Skype has now moved to a cloud-based architecture (Gillet 2013)

  2. we assume a perfect detector

References

  • Anceaume, E., Gradinariu, M., & Ravoaja, A. (2005). Incentives for p2p fair resource sharing. In Peer-to-Peer Computing, 2005. P2P 2005. Fifth IEEE International Conference on IEEE, pp 253–260.

  • Bauer, K., McCoy, D., Grunwald, D., Kohno, T., & Sicker, D. (2007). Low-resource routing attacks against tor. In Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society, ACM, New York, NY, USA, WPES ’07, pp 11–20.

  • Buford, J., Yu, H., & Lua, E.K. (2008). P2P Networking and Applications. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.

  • Daswani, N., & Garcia-Molina, H. (2002). Query-flood dos attacks in gnutella. In Proceedings of the 9th ACM Conference on Computer and Communications Security, ACM, New York, NY, USA, CCS ’02, pp 181–192.

  • Duma, C., Karresand, M., Shahmehri, N., & Caronni, G. (2006). A trust-aware, p2p-based overlay for intrusion detection. In Database and Expert Systems Applications, 2006. DEXA’06. 17th International Workshop on, IEEE, pp 692–697.

  • Gatti, R., Lewis, S., Ozment, A., Rayna, T., & Serjantov, A. (2004). Sufficiently secure peer-to-peer networks. In Proceedings of the Third Workshop on Economics and Information Security.

  • Gillet, M. (2013). Skype’s cloud-based architecture., http://blogs.skype.com/2013/10/04/skype-architecture-update/, accessed on 5th January 2015.

  • Janakiraman, R., Waldvogel, M., & Zhang, Q. (2003). Indra: A peer-to-peer approach to network intrusion detection and prevention. In Enabling Technologies: Infrastructure for Collaborative Enterprises, 2003. WET ICE 2003. Proceedings. Twelfth IEEE International Workshops on, IEEE, 226–231.

  • Kamvar, S.D., Schlosser, M.T., & Garcia-Molina, H. (2003). The eigentrust algorithm for reputation management in p2p networks. In Proceedings of the 12th international conference on World Wide Web, ACM, pp 640–651.

  • Keynes, J.M. (2013). A treatise on probability. Courier Dover Publications.

  • Kodialam, M., & Lakshman, T. (2003). Detecting network intrusions via sampling: a game theoretic approach. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, IEEE, 3, 1880–1889.

  • Korzhyk, D., Yin, Z., Kiekintveld, C., Conitzer, V., & Tambe, M. (2011). Stackelberg vs. nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. J Artif Intell Res(JAIR), 41, 297–327.

    Google Scholar 

  • Letchford, J. (2013). Computational aspects of stackelberg games. PhD thesis: Duke University.

    Google Scholar 

  • Locasto, M.E., Parekh, J.J., Keromytis, A.D., & Stolfo, S.J. (2005). Towards collaborative security and p2p intrusion detection. In Information Assurance Workshop, 2005. IAW’05. Proceedings from the Sixth Annual IEEE SMC,IEEE, 333–339.

  • Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005). A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials, 7(2), 72–93.

    Article  Google Scholar 

  • Manshaei, M.H., Zhu, Q., Alpcan, T., Bacṡar, T., & Hubaux, J.P. (2013). Game theory meets network security and privacy. ACM Computing Surveys (CSUR), 45(3), 25.

    Article  Google Scholar 

  • Moscibroda, T., Schmid, S., & Wattenhofer, R. (2006). When selfish meets evil: Byzantine players in a virus inoculation game. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, ACM, 35–44.

  • Motwani, R., & Raghavan, P. (2010). Randomized algorithms. Chapman & Hall/CRC.

  • Murdoch, S.J., & Danezis, G. (2005). Low-cost traffic analysis of tor. In Proceedings of the 2005 IEEE Symposium on Security and Privacy, IEEE Computer Society, Washington, DC, USA, SP ’05, 183–195.

  • Narang, P., Mehta, K., & Hota, C. (2014). Game-theoretic patrolling strategies for intrusion detection in collaborative peer-to-peer networks. In International Conference on Secure Knowledge Management in Big-data era.

  • Nash, J.F., & et al. (1950). Equilibrium points in n-person games. Proceedings of the national academy of sciences, 36(1), 48–49.

    Article  Google Scholar 

  • Sit, E., & Morris, R. (2002). Security considerations for peer-to-peer distributed hash tables. In Peer-to-Peer Systems, Springer, pp 261–269.

  • Steinmetz, R., & Wehrle, K. (Eds.) (2005). Peer-to-peer systems and applications, lecture notes in computer science, vol 3485: Springer.

  • Theodorakopoulos, G., & Baras, J. (2008). Game theoretic modeling of malicious users in collaborative networks. Selected Areas in Communications. IEEE Journal on, 26(7), 1317–1327.

    Google Scholar 

  • Theodorakopoulos, G., & Baras, J.S. (2007). Malicious users in unstructured networks. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, IEEE, pp 884–891.

  • Vaněk, O., Yin, Z., Jain, M., Bošanskỳ, B., Tambe, M., & Pěchouček, M. (2012). Game-theoretic resource allocation for malicious packet detection in computer networks. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, International Foundation for Autonomous Agents and Multiagent Systems, 905–912.

  • Ye, S., Makedon, F., & Ford, J. (2004). Collaborative automated trust negotiation in peer-to-peer systems. In Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on, IEEE, 108–115.

  • Zhu, Y., & Fu, H. (2011). Traffic analysis attacks on skype voip calls. Computer Communications, 34(10), 1202–1212.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pratik Narang.

Additional information

This work was supported by Grant number 12(13)/2012-ESD for scientific research under Cyber Security area, e-Security division, from the Department of Electronics & Information Technology (DeitY), Govt. of India, New Delhi, India.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Narang, P., Hota, C. Game-theoretic strategies for IDS deployment in peer-to-peer networks. Inf Syst Front 17, 1017–1028 (2015). https://doi.org/10.1007/s10796-015-9582-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10796-015-9582-1

Keywords

Navigation