Abstract
Currently the field of network forensics lacks a methodology for attack fingerprinting. Such a methodology would enhance attack attribution. Currently, attack attribution is often quite subjective. The current research provides a mathematically rigorous procedure for creating fingerprints of network intrusions. These fingerprints can be compared to the fingerprints of known cyber-attacks, to provide a mathematically robust method for attack attribution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)
Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Courier Dover Publications (2017)
Easttom, C.: On the application of algebraic graph theory to modeling network intrusions. In: IEEE 10th Annual Computing and Communication Conference, pp. 0424–0430 (2020)
Easttom, C., Adda, M.: The creation of network intrusion fingerprints by graph (2020)
Easttom, C. Adda, M.: The creation of network intrusion fingerprints by graph homomorphism. WSEAS Trans. Inform. Sci. Appl. 17. https://doi.org/10.37394/23209.2020.17.15
Goldreich, O.: Flexible models for testing graph properties. Comput. Comp./Prop. Test. 352–362 (2020)
Godsil, C., Royle, G.F.: Algebraic graph theory. Springer Science & Business Media, New York (2013)
Gross, J., Yellen, J., Zhang, P.: Handbook of Graph Theory. CRC Press, New York (2013)
Han, L., Liu, G., Yang, X., Han, B.: A computational synthesis approach of mechanical conceptual design based on graph theory and polynomial operation. Chin. J. Mech. Eng. 33(1), 2 (2020)
Hartsfield, N., Ringel, G.: Pearls in Graph Theory: A Comprehensive Introduction. Courier Corporation (2013)
Hoffmann, R., McCreesh, C., Reilly, C.: Between subgraph isomorphism and maximum common subgraph. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 31, no. 1 (2017)
Knauer, U., Knauer, K.: Algebraic Graph Theory: Morphisms, Monoids and Matrices. Walter de Gruyter Press, Berlin (2019)
Kulkarni, S.J.: Graph theory: applications to chemical engineering and chemistry. Galore Int. J. Appl. Sci. Human. 1(2), 17–20 (2017)
Marzuki, C.C.: Total irregularity strength of m-copies of rhombus graph. J. Phys.: Conf. Ser. 1116(2), 022023 (2018)
Palmer, I., Gelfand, B., Campbell, R.: Exploring digital evidence with graph theory. In: 2017 ADFSL Conference on Digital Forensics, Security, and Law (2017)
Qiao, Z., Koolen, J.H., Markowsky, G.: On the Cheeger constant for distance-regular graphs. J. Combinat. Theory, Ser. A 173, 105227 (2020)
Samsi, S., et al.: Static graph challenge: subgraph isomorphism. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1–6, September 2017
Sporns, O.: Graph theory methods: applications in brain networks. Dial. Clin. Neurosci. 20(2), 111 (2018)
Wang, W.: A graph-oriented approach for network forensic analysis. Dissertation, Iowa State (2010). https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=2722&context=etd. Acccessed 4 Aug 2021
Takahashi, D., Xiao, Y, Meng, K.: Creating user-relationship-graph in use of flow-net and log files for computer and network accountability and forensics. In: 2010-MILCOM 2010 Military Communications Conference (2010)
Barrère, M., Steiner, R.V., Mohsen, R., Lupu, E.C.: Tracking the bad guys: an efficient forensic methodology to trace multi-step attacks using core attack graphs. In: 2017 13th International Conference on Network and Service Management (CNSM), pp. 1–7 (2017)
Milling, C., Caramanis, C., Mannor, S., Shakkottai, S.: Network forensics: random infection vs spreading epidemic. ACM SIGMETRICS Perform. Eval. Rev. 40(1), 223–234 (2012)
Valsesia, D., Coluccia, G., Bianchi, T., Magli, E.: Compressed fingerprint matching and camera identification via random projections. IEEE Trans. Inf. Forensics Secur. 10(7), 1472–1485 (2015)
Lee, W., Cho, S., Choi, H., Kim, J.: Partial fingerprint matching using minutiae and ridge shape features for small fingerprint scanners. Exp. Syst. Appl.: Int. J. 87(C), 183–198 (2017)
Easttom, C.: A systematic framework for network forensics based on graph theory. University of Portsmouth (2021)
Thulasiraman, K., Arumugam, S., Nishizeki, T., Brandstädt, A.: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms. Taylor & Francis (2016)
Linke, N.M., Johri, S., Figgatt, C., Landsman, K.A., Matsuura, A.Y., Monroe, C.: Measuring the Rényi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer. Phys. Rev. 98(5), 052334 (2018)
Hayashi, M. (2017). Quantum Information Theory. Graduate Texts in Physics, no. 2. Springer Press, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49725-8
Mishra, S., Ayyub, B.M.: Shannon entropy for quantifying uncertainty and risk in economic disparity. Risk Anal. 39(10), 2160–2181 (2019)
Dehmer, M., Emmert-Streib, F. (eds.): Quantitative Graph Theory: Mathematical Foundations and Applications. CRC Press, New York (2014)
De Meo, P., Messina, F., Rosaci, D., Sarné, G.M., Vasilakos, A.V.: Estimating graph robustness through the Randic index. IEEE Trans. Cybern. 48(11), 3232–3242 (2017)
Kim, S.J., Ozeki, K.: A note on a Brooks’ type theorem for DP-coloring. J. Graph Theory 91(2), 148–161 (2019)
Parimala, M., Broumi, S., Prakash, K., Topal, S.: Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment. Comp. Intell. Syst. 7(5), 2373–2381 (2021)
Easttom, C.: A systems approach to indicators of compromise utilizing graph theory. In: 2018 IEEE International Symposium on Technologies for Homeland Security (2018)
Easttom, C.: How to model digital forensics investigations with graph theory. Digit. Forensics Mag. 37 (2018)
Easttom, C.: On the application of algebraic graph theory to modeling network intrusions. 2020 IEEE 10th Annual Computing and Communication Conference (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Easttom, C. (2022). A Graph Theoretical Methodology for Network Intrusion Fingerprinting and Attack Attribution. In: Arai, K. (eds) Intelligent Computing. SAI 2022. Lecture Notes in Networks and Systems, vol 508. Springer, Cham. https://doi.org/10.1007/978-3-031-10467-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-031-10467-1_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-10466-4
Online ISBN: 978-3-031-10467-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)