A Graph Theory Based Self-Learning Honeypot to Detect Persistent Threats

5Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Attacks on the cyber space is getting exponential in recent times. Illegal penetrations and breaches are real threats to the individuals and organizations. Conventional security systems are good enough to detect the known threats but when it comes to Advanced Persistent Threats (APTs) they fails. These APTs are targeted, more sophisticated and very persistent and incorporates lot of evasive techniques to bypass the existing defenses. Hence, there is a need for an effective defense system that can achieve a complete reliance of security. To address the above-mentioned issues, this paper proposes a novel honeypot system that tracks the anonymous behavior of the APT threats. The key idea of honeypot leverages the concepts of graph theory to detect such targeted attacks. The proposed honeypot is self-realizing, strategic assisted which withholds the APTs actionable techniques and observes the behavior for analysis and modelling. The proposed graph theory based self learning honeypot using the results γ(C(n,1)),γc (C(n,1)), γsc (C(n,1)) outperforms traditional techniques by detecting APTs behavioral with detection rate of 96%.

Cite

CITATION STYLE

APA

Pavendan, R. T., Sankar, K., & Varun Kumar, K. A. (2023). A Graph Theory Based Self-Learning Honeypot to Detect Persistent Threats. Intelligent Automation and Soft Computing, 35(3), 3331–3348. https://doi.org/10.32604/iasc.2023.028029

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free