Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM66123
Volume:
10 |
7 |
Jul 2026
Pages:
1-5
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Computer Application
Sanjay Ghodawat Uiversity
Today's computing systems are vulnerable to zero-day attacks, which take advantage of an unknown vulnerability, and signature-based intrusion detection systems are of little use. Current behavior-based detection methods are becoming more dependent on machine learning methods on system or network behavior graph models, yet these methods are typically costly in terms of computational complexity, lack interpretability and require substantial amounts of training data. To overcome the above drawbacks, this paper introduces a behavior-based zero-day attack detection framework based on graph-theoretic analysis. The behaviours of the system (e.g. network flows, system calls) are represented as a graph, which represents both the structure and the temporal relationships amongst the system entities. The proposed method does not depend on black-box learning models, but on the detection of abnormal local subgraph patterns that differ from the normal behavior profiles. A novel graph-based anomaly metric is proposed to measure the structural anomalies and detect suspicious behaviour that may be related to zero-day attacks. The performance of the proposed approach is assessed by comparing the proposed approach with the traditional signature based detection method, and it is shown that the proposed approach has better detection capability for new attacks, while retaining the interpretability and computational efficiency. According to the results, the graph-theoretic behavior modeling method has a good potential for being used in zero-day attack detection in dynamic and evolving cyber environments and is also explainable.
KEYWORDS
This paper presented a behavior-based zero-day attack detection framework using graph-theoretic analysis, aimed at overcoming the limitations of traditional signature-based and learning-heavy intrusion detection systems. By modeling system runtime behavior as graphs and focusing on anomalous local subgraph patterns, the proposed approach enables effective detection of previously unseen attacks without relying on predefined attack signatures or black-box machine learning models. The experimental results demonstrate that the proposed method achieves improved detection capability, computational efficiency, and interpretability when compared to conventional signature-based techniques. The graph-based representation provides valuable insight into system behavior and supports explainable security analysis, making the approach suitable for practical deployment in real-world cybersecurity environments. Overall, the findings suggest that graph-theoretic behavior modeling represents a promising and robust direction for zero-day attack detection. Future work will focus on enhancing scalability, incorporating adaptive learning mechanisms, and validating the approach on large-scale real-world datasets to further strengthen its applicability in modern cyber defense systems.
[1] Cyber Security S. Axelsson, “Intrusion Detection Systems: A Survey and Taxonomy,” Technical Report, Chalmers University of Technology, 2000. [2] IEEE V. Chandola, A. Banerjee, and V. Kumar, “Anomaly Detection: A Survey,” ACM Computing Surveys, vol. 41, no. 3, pp. 1–58, 2009. [3] IEEE D. E. Denning, “An Intrusion Detection Model,” IEEE Transactions on Software Engineering, vol. SE-13, no. 2, pp. 222–232, 1987. [4] IEEE W. Lee and S. Stolfo, “A Framework for Constructing Features and Models for Intrusion Detection Systems,” ACM Transactions on Information Systems Security, vol. 3, no. 4, pp. 227–261, 2000. [5] M. Roesch, “Snort: Lightweight Intrusion Detection for Networks,” Proceedings of LISA, pp. 229–238, 1999. [6] R. Sommer and V. Paxson, “Outside the Closed World: On Using Machine Learning for Network Intrusion Detection,” IEEE Symposium on Security and Privacy, pp. 305–316, 2010. [7] L. Akoglu, H. Tong, and D. Koutra, “Graph Based Anomaly Detection and Description: A Survey,” Data Mining and Knowledge Discovery, vol. 29, no. 3, pp. 626–688, 2015. [8] C. C. Noble and D. J. Cook, “Graph-Based Anomaly Detection,” Proceedings of ACM SIGKDD, pp. 631–636, 2003. [10] M. Eberle and L. Holder, “Discovering Structural Anomalies in Graph-Based Data,” IEEE ICDM Workshops, pp. 393–398, 2007.
Publication Date
7/17/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
1
Total views since publication
PDF Downloads
7
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...