{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:11:08Z","timestamp":1743012668103,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031104664"},{"type":"electronic","value":"9783031104671"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10467-1_34","type":"book-chapter","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T17:03:56Z","timestamp":1657127036000},"page":"550-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Theoretical Methodology for Network Intrusion Fingerprinting and Attack Attribution"],"prefix":"10.1007","author":[{"given":"Chuck","family":"Easttom","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)"},{"key":"34_CR2","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Courier Dover Publications (2017)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Easttom, C.: On the application of algebraic graph theory to modeling network intrusions. In: IEEE 10th Annual Computing and Communication Conference, pp. 0424\u20130430 (2020)","DOI":"10.1109\/CCWC47524.2020.9031224"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Easttom, C., Adda, M.: The creation of network intrusion fingerprints by graph (2020)","DOI":"10.37394\/23209.2020.17.15"},{"key":"34_CR5","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.37394\/23209.2020.17.15"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Flexible models for testing graph properties. Comput. Comp.\/Prop. Test. 352\u2013362 (2020)","DOI":"10.1007\/978-3-030-43662-9_19"},{"key":"34_CR7","unstructured":"Godsil, C., Royle, G.F.: Algebraic graph theory. Springer Science & Business Media, New York  (2013)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Gross, J., Yellen, J., Zhang, P.: Handbook of Graph Theory. CRC Press, New York (2013)","DOI":"10.1201\/b16132"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/s10033-019-0424-9","volume":"33","author":"L Han","year":"2020","unstructured":"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)","journal-title":"Chin. J. Mech. Eng."},{"key":"34_CR10","unstructured":"Hartsfield, N., Ringel, G.: Pearls in Graph Theory: A Comprehensive Introduction. Courier Corporation (2013)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1609\/aaai.v31i1.11137"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Knauer, U., Knauer, K.: Algebraic Graph Theory: Morphisms, Monoids and Matrices. Walter de Gruyter Press, Berlin (2019)","DOI":"10.1515\/9783110617368"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.J.: Graph theory: applications to chemical engineering and chemistry. Galore Int. J. Appl. Sci. Human. 1(2), 17\u201320 (2017)","DOI":"10.1002\/speg.30690"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Marzuki, C.C.: Total irregularity strength of m-copies of rhombus graph. J. Phys.: Conf. Ser. 1116(2), 022023 (2018)","DOI":"10.1088\/1742-6596\/1116\/2\/022023"},{"key":"34_CR15","unstructured":"Palmer, I., Gelfand, B., Campbell, R.: Exploring digital evidence with graph theory. In: 2017 ADFSL Conference on Digital Forensics, Security, and Law (2017)"},{"key":"34_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105227","volume":"173","author":"Z Qiao","year":"2020","unstructured":"Qiao, Z., Koolen, J.H., Markowsky, G.: On the Cheeger constant for distance-regular graphs. J. Combinat. Theory, Ser. A 173, 105227 (2020)","journal-title":"J. Combinat. Theory, Ser. A"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Samsi, S., et al.: Static graph challenge: subgraph isomorphism. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20136, September 2017","DOI":"10.1109\/HPEC.2017.8091039"},{"issue":"2","key":"34_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.31887\/DCNS.2018.20.2\/osporns","volume":"20","author":"O Sporns","year":"2018","unstructured":"Sporns, O.: Graph theory methods: applications in brain networks. Dial. Clin. Neurosci. 20(2), 111 (2018)","journal-title":"Dial. Clin. Neurosci."},{"key":"34_CR19","unstructured":"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"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/MILCOM.2010.5679519"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Barr\u00e8re, 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\u20137 (2017)","DOI":"10.23919\/CNSM.2017.8256038"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Milling, C., Caramanis, C., Mannor, S., Shakkottai, S.: Network forensics: random infection vs spreading epidemic. ACM SIGMETRICS Perform. Eval. Rev. 40(1), 223\u2013234 (2012)","DOI":"10.1145\/2318857.2254784"},{"issue":"7","key":"34_CR23","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TIFS.2015.2415461","volume":"10","author":"D Valsesia","year":"2015","unstructured":"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\u20131485 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"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\u2013198 (2017)","DOI":"10.1016\/j.eswa.2017.06.019"},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Easttom, C.: A systematic framework for network forensics based on graph theory. University of Portsmouth (2021)","DOI":"10.1201\/9781003118718-10"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Thulasiraman, K., Arumugam, S., Nishizeki, T., Brandst\u00e4dt, A.: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms. Taylor & Francis (2016)","DOI":"10.1201\/b19163"},{"issue":"5","key":"34_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.052334","volume":"98","author":"NM Linke","year":"2018","unstructured":"Linke, N.M., Johri, S., Figgatt, C., Landsman, K.A., Matsuura, A.Y., Monroe, C.: Measuring the R\u00e9nyi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer. Phys. Rev. 98(5), 052334 (2018)","journal-title":"Phys. Rev."},{"key":"34_CR28","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1007\/978-3-662-49725-8"},{"issue":"10","key":"34_CR29","doi-asserted-by":"publisher","first-page":"2160","DOI":"10.1111\/risa.13313","volume":"39","author":"S Mishra","year":"2019","unstructured":"Mishra, S., Ayyub, B.M.: Shannon entropy for quantifying uncertainty and risk in economic disparity. Risk Anal. 39(10), 2160\u20132181 (2019)","journal-title":"Risk Anal."},{"key":"34_CR30","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Emmert-Streib, F. (eds.): Quantitative Graph Theory: Mathematical Foundations and Applications. CRC Press, New York  (2014)","DOI":"10.1201\/b17645"},{"key":"34_CR31","doi-asserted-by":"crossref","unstructured":"De Meo, P., Messina, F., Rosaci, D., Sarn\u00e9, G.M., Vasilakos, A.V.: Estimating graph robustness through the Randic index. IEEE Trans. Cybern. 48(11), 3232\u20133242 (2017)","DOI":"10.1109\/TCYB.2017.2763578"},{"issue":"2","key":"34_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/jgt.22425","volume":"91","author":"SJ Kim","year":"2019","unstructured":"Kim, S.J., Ozeki, K.: A note on a Brooks\u2019 type theorem for DP-coloring. J. Graph Theory 91(2), 148\u2013161 (2019)","journal-title":"J. Graph Theory"},{"issue":"5","key":"34_CR33","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s40747-021-00430-w","volume":"7","author":"M Parimala","year":"2021","unstructured":"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\u20132381 (2021)","journal-title":"Comp. Intell. Syst."},{"key":"34_CR34","unstructured":"Easttom, C.: A systems approach to indicators of compromise utilizing graph theory. In: 2018 IEEE International Symposium on Technologies for Homeland Security (2018)"},{"key":"34_CR35","unstructured":"Easttom, C.: How to model digital forensics investigations with graph theory. Digit. Forensics Mag. 37 (2018)"},{"key":"34_CR36","doi-asserted-by":"crossref","unstructured":"Easttom, C.: On the application of algebraic graph theory to modeling network intrusions. 2020 IEEE 10th Annual Computing and Communication Conference (2020)","DOI":"10.1109\/CCWC47524.2020.9031224"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10467-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T13:06:20Z","timestamp":1685797580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10467-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031104664","9783031104671"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10467-1_34","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Science and Information Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/Computing","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}