├── .gitignore ├── Datasets └── README.md ├── LICENSE ├── README.md ├── Taxonomy ├── 0-main.tex ├── 0.1-header.tex ├── 0.2-vertical-lines.tex ├── 1-networking.tex ├── 2-host_3-software.tex ├── 4-physical_5-human.tex ├── 6-others.tex ├── Readme.md └── additional_ref.bib ├── Tools ├── Readme.md └── main.tex └── images ├── Taxonomy_1.PNG ├── Taxonomy_2.PNG ├── Taxonomy_3.PNG └── Tools.PNG /.gitignore: -------------------------------------------------------------------------------- 1 | ## Core latex/pdflatex auxiliary files: 2 | *.aux 3 | *.lof 4 | *.log 5 | *.lot 6 | *.fls 7 | *.out 8 | *.toc 9 | *.fmt 10 | *.fot 11 | *.cb 12 | *.cb2 13 | .*.lb 14 | 15 | ## Intermediate documents: 16 | *.dvi 17 | *.xdv 18 | *-converted-to.* 19 | # these rules might exclude image files for figures etc. 20 | # *.ps 21 | # *.eps 22 | # *.pdf 23 | 24 | ## Generated if empty string is given at "Please type another file name for output:" 25 | .pdf 26 | 27 | ## Bibliography auxiliary files (bibtex/biblatex/biber): 28 | *.bbl 29 | *.bcf 30 | *.blg 31 | *-blx.aux 32 | *-blx.bib 33 | *.run.xml 34 | 35 | ## Build tool auxiliary files: 36 | *.fdb_latexmk 37 | *.synctex 38 | *.synctex(busy) 39 | *.synctex.gz 40 | *.synctex.gz(busy) 41 | *.pdfsync 42 | 43 | ## Build tool directories for auxiliary files 44 | # latexrun 45 | latex.out/ 46 | 47 | ## Auxiliary and intermediate files from other packages: 48 | # algorithms 49 | *.alg 50 | *.loa 51 | 52 | # achemso 53 | acs-*.bib 54 | 55 | # amsthm 56 | *.thm 57 | 58 | # beamer 59 | *.nav 60 | *.pre 61 | *.snm 62 | *.vrb 63 | 64 | # changes 65 | *.soc 66 | 67 | # cprotect 68 | *.cpt 69 | 70 | # elsarticle (documentclass of Elsevier journals) 71 | *.spl 72 | 73 | # endnotes 74 | *.ent 75 | 76 | # fixme 77 | *.lox 78 | 79 | # feynmf/feynmp 80 | *.mf 81 | *.mp 82 | *.t[1-9] 83 | *.t[1-9][0-9] 84 | *.tfm 85 | 86 | #(r)(e)ledmac/(r)(e)ledpar 87 | *.end 88 | *.?end 89 | *.[1-9] 90 | *.[1-9][0-9] 91 | *.[1-9][0-9][0-9] 92 | *.[1-9]R 93 | *.[1-9][0-9]R 94 | *.[1-9][0-9][0-9]R 95 | *.eledsec[1-9] 96 | *.eledsec[1-9]R 97 | *.eledsec[1-9][0-9] 98 | *.eledsec[1-9][0-9]R 99 | *.eledsec[1-9][0-9][0-9] 100 | *.eledsec[1-9][0-9][0-9]R 101 | 102 | # glossaries 103 | *.acn 104 | *.acr 105 | *.glg 106 | *.glo 107 | *.gls 108 | *.glsdefs 109 | 110 | # gnuplottex 111 | *-gnuplottex-* 112 | 113 | # gregoriotex 114 | *.gaux 115 | *.gtex 116 | 117 | # htlatex 118 | *.4ct 119 | *.4tc 120 | *.idv 121 | *.lg 122 | *.trc 123 | *.xref 124 | 125 | # hyperref 126 | *.brf 127 | 128 | # knitr 129 | *-concordance.tex 130 | # TODO Comment the next line if you want to keep your tikz graphics files 131 | *.tikz 132 | *-tikzDictionary 133 | 134 | # listings 135 | *.lol 136 | 137 | # makeidx 138 | *.idx 139 | *.ilg 140 | *.ind 141 | *.ist 142 | 143 | # minitoc 144 | *.maf 145 | *.mlf 146 | *.mlt 147 | *.mtc[0-9]* 148 | *.slf[0-9]* 149 | *.slt[0-9]* 150 | *.stc[0-9]* 151 | 152 | # minted 153 | _minted* 154 | *.pyg 155 | 156 | # morewrites 157 | *.mw 158 | 159 | # nomencl 160 | *.nlg 161 | *.nlo 162 | *.nls 163 | 164 | # pax 165 | *.pax 166 | 167 | # pdfpcnotes 168 | *.pdfpc 169 | 170 | # sagetex 171 | *.sagetex.sage 172 | *.sagetex.py 173 | *.sagetex.scmd 174 | 175 | # scrwfile 176 | *.wrt 177 | 178 | # sympy 179 | *.sout 180 | *.sympy 181 | sympy-plots-for-*.tex/ 182 | 183 | # pdfcomment 184 | *.upa 185 | *.upb 186 | 187 | # pythontex 188 | *.pytxcode 189 | pythontex-files-*/ 190 | 191 | # thmtools 192 | *.loe 193 | 194 | # TikZ & PGF 195 | *.dpth 196 | *.md5 197 | *.auxlock 198 | 199 | # todonotes 200 | *.tdo 201 | 202 | # easy-todo 203 | *.lod 204 | 205 | # xmpincl 206 | *.xmpi 207 | 208 | # xindy 209 | *.xdy 210 | 211 | # xypic precompiled matrices 212 | *.xyc 213 | 214 | # endfloat 215 | *.ttt 216 | *.fff 217 | 218 | # Latexian 219 | TSWLatexianTemp* 220 | 221 | ## Editors: 222 | # WinEdt 223 | *.bak 224 | *.sav 225 | 226 | # Texpad 227 | .texpadtmp 228 | 229 | # Kile 230 | *.backup 231 | 232 | # KBibTeX 233 | *~[0-9]* 234 | 235 | # auto folder when using emacs and auctex 236 | ./auto/* 237 | *.el 238 | 239 | # expex forward references with \gathertags 240 | *-tags.tex 241 | 242 | # standalone packages 243 | *.sta 244 | 245 | # generated if using elsarticle.cls 246 | *.spl -------------------------------------------------------------------------------- /Datasets/README.md: -------------------------------------------------------------------------------- 1 | # Datasets 2 | Machine Learning Intrusion Detection System rely heavily on datasets. This page provides a list of datasets 3 | and associated links 4 | 5 | ## Contributions 6 | Feel free to contribute, add, modify the links as well as add missing sections, or send us an email if a link is deprecated. 7 | 8 | 9 | ## Mobile Application 10 | * [Android Malwre Genome](http://www.malgenomeproject.org/) 11 | * [M0droid Dataset](http://m0droid.netai.net/modroid/) 12 | * [Drebin Dataset](https://www.sec.cs.tu-bs.de/~danarp/drebin/) 13 | * [AndroMalShare](http://sanddroid.xjtu.edu.cn:8080/#home) 14 | * [Kharon Malware Dataset](http://kharon.gforge.inria.fr/dataset/) 15 | * [AMD Project](http://amd.arguslab.org/) 16 | * [Android PRAGuard Dataset](http://pralab.diee.unica.it/en/AndroidPRAGuardDataset) 17 | * [Andro Zoo](https://androzoo.uni.lu/) 18 | * [Android Validation Dataset](http://www.unb.ca/cic/datasets/android-validation.html) 19 | * [Android Botnet Dataset](http://www.unb.ca/cic/datasets/android-botnet.html) 20 | * [Android Adware and General Malware Dataset](http://www.unb.ca/cic/datasets/android-adware.html) 21 | * [Contagio](http://contagiominidump.blogspot.com/) 22 | 23 | ## Virtual Networks 24 | * [VPN-nonVPN dataset](http://www.unb.ca/cic/datasets/vpn.html) 25 | 26 | 27 | ## TOR Network 28 | * [TOR-nonTOR dataset](http://www.unb.ca/cic/datasets/tor.html) 29 | 30 | ## Network Traffic 31 | * [ADFA-LD - Linux HIDS](https://www.unsw.adfa.edu.au/unsw-canberra-cyber/cybersecurity/ADFA-IDS-Datasets/) 32 | * [ADFA-WD - Windows HIDS](https://www.unsw.adfa.edu.au/unsw-canberra-cyber/cybersecurity/ADFA-IDS-Datasets/) 33 | * [ADFA-WD:SAA - Windows Dataset: Stealth Attacks Addendum](https://www.unsw.adfa.edu.au/unsw-canberra-cyber/cybersecurity/ADFA-IDS-Datasets/) 34 | * [ADFA-IDS](https://www.azsecure-data.org/other-data.html) 35 | * [Aktaion Example Labeled Data](https://github.com/jzadeh/Aktaion) [link2](https://www.azsecure-data.org/other-data.html) 36 | * [Chris Sanders Packet Captures](https://github.com/chrissanders/packets) 37 | * [Comprehensive, Multi-Source Cyber-Security Events](https://csr.lanl.gov/data/cyber1/) 38 | * [CTU-13 - Networked Malware Dataset](https://mcfp.weebly.com/the-ctu-13-dataset-a-labeled-dataset-with-botnet-normal-and-background-traffic.html) 39 | * [ShadowBrokers Dataset by Eric Conrad](http://www.ericconrad.com/2017/04/shadowbrokers-pcaps-etc.html) 40 | * [Unified Network Dataset](https://csr.lanl.gov/data/2017.html) 41 | * [VERIS Community Database](https://github.com/vz-risk/VCDB) 42 | * [ISCXIDS2012](http://www.unb.ca/cic/datasets/ids.html) 43 | * [CICIDS2017](http://www.unb.ca/cic/datasets/ids-2017.html) 44 | * [NSL-KDDdataset](http://www.unb.ca/cic/datasets/nsl.html) 45 | * [CIC DoS dataset](http://www.unb.ca/cic/datasets/dos-dataset.html) 46 | * [KDD99](http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html) 47 | * [GureKddcup](http://www.sc.ehu.es/acwaldap/gureKddcup/) 48 | * [DARPA98](https://www.ll.mit.edu/ideval/data/) 49 | * [DARPA99](https://www.ll.mit.edu/ideval/data/) 50 | * [DARPA2000](https://www.ll.mit.edu/ideval/data/) 51 | * [MACCDC](https://www.netresec.com/?page=MACCDC) 52 | * [WRCCDC](https://archive.wrccdc.org/pcaps/) 53 | * [ISACDC09](http://www.westpoint.edu/crc/SitePages/DataSets.aspx) 54 | * [Rapid7 OpenData](https://opendata.rapid7.com/) 55 | * [UNIBS-2009](http://netweb.ing.unibs.it/~ntw/tools/traces/) 56 | * [Cambridge Inmotion](https://crawdad.org/cambridge/inmotion/20051001/) 57 | * [MAWI Working Group Traffic](http://mawi.wide.ad.jp/mawi/) 58 | * [CAIDA 2016](http://www.caida.org/data/passive/passive_2016_dataset.xml) 59 | * [LBNL/ICSI Enterprise Tracing Repository](https://www.icir.org/enterprise-tracing/download.html) 60 | * [MERTOSEC](http://projects.laas.fr/METROSEC/) 61 | * [Sperotto’s (Twente)](https://research.utwente.nl/en/publications/a-labeled-data-set-for-flow-based-intrusion-detection) Flow-based dataset 62 | * [UNSW-NB15](https://www.unsw.adfa.edu.au/unsw-canberra-cyber/cybersecurity/ADFA-NB15-Datasets/) 63 | * [STA2018](https://github.com/elud074/STA2018) 64 | 65 | ## Botnet 66 | * [ISOT Botnet](https://www.uvic.ca/engineering/ece/isot/datasets/) 67 | * [Botnet dataset](http://www.unb.ca/cic/datasets/botnet.html) 68 | * [UCI IoT Botnet Attacks](http://archive.ics.uci.edu/ml/datasets/detection_of_IoT_botnet_attacks_N_BaIoT) 69 | * [CTU-13](https://www.stratosphereips.org/datasets-ctu13/) [1] 70 | * [Kyoto University's Honeypots](http://www.takakura.com/Kyoto_data/) 71 | 72 | ## SCADA 73 | * [4SICS ICS](https://www.netresec.com/?page=PCAP4SICS) 74 | * [DigitalBond S4x15 ICS Village CTF PCAPs](https://www.netresec.com/?page=DigitalBond_S4) 75 | * [DEFCON ICS 2003](https://media.defcon.org/DEFCON23/DEFCON23villages/DEFCON23icsvillage/DEFCON23ICSVillagepacketcaptures.rar) 76 | * [Anomalies Water System](https://www.sciencedirect.com/science/article/pii/S2352340917303402) 77 | * [Kaspersky ICS](https://box.kaspersky.com/d/56ad570fca/?p=/) 78 | 79 | ## IoT 80 | * [Dweet.io IoT device schema](https://eprints.soton.ac.uk/407966/) 81 | 82 | 83 | ## Malware 84 | * [Microsoft’s Malware Dataset](https://www.kaggle.com/c/malware-classification), [Paper](https://arxiv.org/abs/1802.10135) 85 | * [Eendgame: Ember Malware Dataset](https://www.endgame.com/blog/technical-blog/introducing-ember-open-source-classifier-and-dataset) 86 | * [Ether Malware Analysis Dataset](http://ether.gtisc.gatech.edu/malware.html) [link 2](https://www.azsecure-data.org/other-data.html) 87 | * [CSDMC 2010](http://csmining.org/index.php/malicious-software-datasets-.html) [link2](https://www.azsecure-data.org/other-data.html) 88 | * [Microsoft Malware Classification Challenge Dataset BIG2015](https://www.kaggle.com/c/malware-classification) 89 | * [Marco Ramilli Malware Training Set](https://github.com/marcoramilli/MalwareTrainingSets) 90 | * [Contagio Malware Dump](http://contagiodump.blogspot.com/2013/04/collection-of-pcap-files-from-malware.html) 91 | 92 | ## Crypto-Currency 93 | * [Hijack-BTC](https://github.com/nsg-ethz/hijack-btc) 94 | 95 | ## Web-Chat 96 | * [QQ Chat Logs](https://www.azsecure-data.org/other-data.html) 97 | 98 | ## Modelling & Analysis 99 | * [Unified Host and Network Dataset](https://csr.lanl.gov/data/2017.html) 100 | 101 | ##### Other Contributers: 102 | 1. Ivan Letteri 103 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Network Threats And Tools Taxonomy 2 | 3 | Machine Learning based Intrusion Detection Systems are difficult to evaluate due to a shortage of datasets representing accurately network traffic and their associated threats. In this project we attempt at solving this problem 4 | by presenting two taxonomies "A Taxonomy and Survey of Intrusion Detection System Design Techniques, Network Threats and Datasets” and “A Taxonomy of Malicious Traffic for Intrusion Detection Systems”, classifying threats 5 | as well as evaluating current datasets. The result shows that a large portion of current research published train IDS algorithms against outdated datasets and outdated threats. To this end, we provide the source of 6 | our threat taxonomy, allowing other researchers to contribute and modify it. 7 | 8 | The taxonomy is a collaboration between Abertay University, The University of Strathclyde, The Naval Academy Research Institute and Middlesex University (Mauritius Campus) 9 | 10 | ## Taxonomy Structure 11 | The taxonomy classifies each network threat according to: 12 | - Its Source (i.e. Networking, Host, Software, Hardware, Human) 13 | - OSI Layer 14 | - Active / Passive 15 | 16 | ## Prerequisites for a push request 17 | Ensure that the latex source compiles correctly 18 | 19 | ## Manuscript & Citations 20 | The final version of our manuscript is published in IEEE Access Jounral. The paper *"A Taxonomy of Network Threats and the Effect of Current Datasets on Intrusion Detection Systems"* can be found [here](https://ieeexplore.ieee.org/document/9108270). 21 | 22 | We have released a pre-print of our article on Arxiv, it includes the original taxonomies in a paper called *"A Taxonomy and Survey of Intrusion Detection System Design Techniques, Network Threats and Datasets"*. The paper can be found [here](https://arxiv.org/abs/1806.03517v1). 23 | 24 | If you want to cite the paper please use the following format; 25 | 26 | ```` 27 | @ARTICLE{9108270, 28 | author={H. {Hindy} and D. {Brosset} and E. {Bayne} and A. {Seeam} and C. {Tachtatzis} and R. {Atkinson} and X. {Bellekens}}, 29 | journal={IEEE Access}, 30 | title={A Taxonomy of Network Threats and the Effect of Current Datasets on Intrusion Detection Systems}, 31 | year={2020}, 32 | volume={}, 33 | number={}, 34 | pages={1-1},} 35 | ```` 36 | 37 | ## Contributors 38 | - Hanan Hindy 39 | - Dr Xavier Bellekens 40 | 41 | 42 | ## Samples from taxonomy 43 | * Threats 44 | 45 | The threats are organised using the 7 layers of the OSI Models as shown below. 46 | 47 | ![Taxonomy_1](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Taxonomy_1.PNG) 48 | ![Taxonomy_2](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Taxonomy_2.PNG) 49 | ![Taxonomy_3](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Taxonomy_3.PNG) 50 | 51 | * Tools 52 | 53 | The Threats are then associated with the tools used to carry the attacks. 54 | 55 | ![Tools](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Tools.PNG) 56 | -------------------------------------------------------------------------------- /Taxonomy/0-main.tex: -------------------------------------------------------------------------------- 1 | \documentclass[a3paper,landscape]{article} 2 | \usepackage[margin=0.7in]{geometry} 3 | \usepackage{comment} 4 | \usepackage{xcolor} 5 | \usepackage{soul} 6 | \usepackage{tikz} 7 | \usetikzlibrary{arrows,positioning,shapes.geometric,calc, shapes, shapes.gates.logic.US} 8 | \title{Network Threats Taxonomy} 9 | 10 | %%%%%%%%%%%%%%%%%%%%% Variables %%%%%%%%%%%%%%%%%%%%% 11 | %%%%%%%%%%% Displacements %%%%%%%%%%% 12 | \def \southXDisplacement {1} 13 | \def \southBorderXDisplacement {1.3} 14 | 15 | %%%%%%%%%%% Distances %%%%%%%%%%% 16 | \def \headerNodeDistance {2.5cm} 17 | \def \halfHeaderNodeDistance {\headerNodeDistance / 2} 18 | \def \largeY {1.2cm} 19 | \def \medY {0.5cm} 20 | \def \smallY {0.2cm} 21 | \def \shiftX {-2cm} 22 | 23 | \tikzset{ 24 | headerblock/.style= {draw=none, rectangle, align=center,minimum width=2.5cm,minimum height=0.75cm, fill=gray!30, font=\bf}, 25 | block/.style= {draw, rectangle, align=center,minimum width=2.4cm,minimum height=0.5cm, font=\bfseries}, 26 | roundedblock/.style= {draw, ellipse, align=center, font=\bfseries, inner sep=0.06cm}, 27 | semiroundedblock/.style= {draw, rounded rectangle, rounded rectangle west arc=0pt, align=center, font=\bfseries, minimum width=2.4cm, minimum height=0.75cm}, 28 | sectionblock/.style= {draw, rectangle, rounded corners=1em, align=center,minimum width=38cm,minimum height=0.75cm, fill=gray!15, font=\bf} 29 | } 30 | 31 | 32 | \begin{document} 33 | 34 | \include{1-networking} 35 | \include{2-host_3-software} 36 | \include{4-physical_5-human} 37 | 38 | \end{document} -------------------------------------------------------------------------------- /Taxonomy/0.1-header.tex: -------------------------------------------------------------------------------- 1 | \node [headerblock] (None) {OSI Layer}; 2 | \node [headerblock, right =\headerNodeDistance of None] (A) {Application}; 3 | \node [headerblock, right =\headerNodeDistance of A] (P) {Presentation}; 4 | \node [headerblock, right =\headerNodeDistance of P] (S) {Session}; 5 | \node [headerblock, right =\headerNodeDistance of S] (T) {Transport}; 6 | \node [headerblock, right =\headerNodeDistance of T] (N) {Network}; 7 | \node [headerblock, right =\headerNodeDistance of N] (D) {Data Link}; 8 | \node [headerblock, right =\headerNodeDistance of D] (H) {Physical}; 9 | 10 | \node [headerblock, below =\smallY of None] (TCP) {TCP/IP Layer}; 11 | \node [headerblock, minimum width=12.3cm, right =\headerNodeDistance of TCP] (TCPA) {Application}; 12 | \node [headerblock, below =\smallY of T] (TCPT) {Transport}; 13 | \node [headerblock, below =\smallY of N] (TCPI) {Internet}; 14 | \node [headerblock, minimum width=7.5cm, right =\headerNodeDistance of TCPI] (TCPP) {Network Access \ \ }; 15 | -------------------------------------------------------------------------------- /Taxonomy/0.2-vertical-lines.tex: -------------------------------------------------------------------------------- 1 | \draw [dashed, ultra thick] ($(None.east)+(\halfHeaderNodeDistance,0)$) -- ($(None.east)+(\halfHeaderNodeDistance,-25)$); 2 | \draw [dashed, ultra thick] ($(A.east)+(\halfHeaderNodeDistance,0)$) -- ($(A.east)+(\halfHeaderNodeDistance,-25)$); 3 | \draw [dashed, ultra thick] ($(P.east)+(\halfHeaderNodeDistance ,0)$) -- ($(P.east)+(\halfHeaderNodeDistance ,-25)$); 4 | \draw [dashed, ultra thick] ($(S.east)+(\halfHeaderNodeDistance ,0)$) -- ($(S.east)+(\halfHeaderNodeDistance ,-25)$); 5 | \draw [dashed, ultra thick] ($(T.east)+(\halfHeaderNodeDistance ,0)$) -- ($(T.east)+(\halfHeaderNodeDistance,-25)$); 6 | \draw [dashed, ultra thick] ($(N.east)+(\halfHeaderNodeDistance ,0)$) -- ($(N.east)+(\halfHeaderNodeDistance,-25)$); 7 | \draw [dashed, ultra thick] ($(D.east)+(\halfHeaderNodeDistance ,0)$) -- ($(D.east)+(\halfHeaderNodeDistance,-25)$); -------------------------------------------------------------------------------- /Taxonomy/1-networking.tex: -------------------------------------------------------------------------------- 1 | \begin{tikzpicture} 2 | 3 | \input{0.1-header} 4 | \input{0.2-vertical-lines} 5 | 6 | %%%%%%%%%%%%%%%%%%%%% Nodes %%%%%%%%%%%%%%%%%%%%% 7 | \node [sectionblock, below right =\largeY and -\headerNodeDistance of None] (S1) {1.Networking}; 8 | 9 | \node [block, below left=\largeY and \shiftX of TCP] (1_1) {1.1 DoS / DDoS}; 10 | \node [block, below right=\smallY and \shiftX of 1_1] (1_1_1) {1.1.1 Flood}; 11 | \node [block, below =\largeY*1.7 of TCPT] (1_1_1_1) {1.1.1.1 Smurf}; 12 | \node [block, below =\largeY*1.7+\smallY+0.5cm of TCPI] (1_1_1_2) {1.1.1.2 ICMP Flood}; 13 | \node [block, below =\largeY*2.6 of TCPT] (1_1_1_3) {1.1.1.3 UDP Flood}; 14 | \node [block, below =\smallY of 1_1_1_3] (1_1_1_4) {1.1.1.4 SYN Flood}; 15 | \node [block, below =\largeY*4.3 of A] (1_1_1_5) {1.1.1.5 HTTP/ Flood}; 16 | \node [block, below =\largeY*3.7 of P] (1_1_1_6) {1.1.1.6 SSL}; 17 | \node [block, below =\smallY of 1_1_1_5] (1_1_2) {1.1.2 Amplification}; 18 | \node [block, below =\largeY*2.5 of 1_1_1] (1_1_3) {1.1.3 Protocol Exploit}; 19 | \node [block, below =\largeY*1.9 of 1_1_1_2] (1_1_3_1) {1.1.3.1 Teardrop}; 20 | \node [block, below left=\smallY and \shiftX*1.2 of 1_1_3_1] (1_1_4) {1.1.4 Malformed\\Packets}; 21 | \node [block, below right=\smallY and \shiftX of 1_1_4] (1_1_4_1) {1.1.4.1 Ping of\\Death}; 22 | \node [block, below =\largeY*1.1 of 1_1_2] (1_1_5) {1.1.5 Buffer\\Overflow}; 23 | 24 | 25 | \node [block, below =\largeY*3.5 of 1_1_1_4] (1_2) {1.2 Packet Forging}; 26 | 27 | \node [block, below =\largeY*1.4 of 1_1_3] (1_3) {1.3 Man-in-the-Middle}; 28 | \node [roundedblock, below =\largeY*7.3 of P] (1_3_1) {1.3.1 Monitor}; 29 | \node [block, below =\smallY of 1_3_1] (1_3_2) {1.3.2 Replay}; 30 | \node [semiroundedblock, below =\medY*2 of 1_1_5] (1_4) {1.4 Man-in-the-browser}; 31 | 32 | \node [block, below =\largeY*1.2 of 1_3] (1_5) {1.5 Impersonate}; 33 | \node [block, below =\largeY*1.5 of 1_1_5] (1_5_1) {1.5.1 Unauthorized\\Access}; 34 | \node [block, below =\smallY of 1_5_1] (1_5_2) {1.5.2 Cloning}; 35 | 36 | \node [block, below left =\largeY*2.3 and \shiftX*1.8 of 1_1_4_1] (1_5_3) {1.5.3 Rogue Access Point}; 37 | 38 | \node [block, below right =\largeY*1.23 and \shiftX*1.2 of 1_5] (1_5_4) {1.5.4 Spoofing}; 39 | \node [block, below =\smallY of 1_5_3] (1_5_4_1) {1.5.4.1 IP Spoofing}; 40 | \node [block, below =\smallY*4.5 of 1_5_2] (1_5_4_2) {1.5.4.2 DNS Spoofing}; 41 | \node [block, below =\largeY*11.3 of D] (1_5_4_3) {1.5.4.3 ARP Spoofing}; 42 | 43 | \node [roundedblock, below =\smallY*4 of 1_5_4] (1_6) {1.6 Scanning/\\Enumeration}; 44 | \node [roundedblock, below left=\largeY/1.2 and \shiftX of 1_5_4_1] (1_6_1) {1.6.1 TCP}; 45 | \node [roundedblock, below right=\smallY and \shiftX*0.7 of 1_6_1] (1_6_1_1) {1.6.1.1 Connect }; 46 | \node [roundedblock, below =\smallY of 1_6_1_1] (1_6_1_2) {1.6.1.2 SYN }; 47 | \node [roundedblock, below =\smallY of 1_6_1_2] (1_6_1_3) {1.6.1.3 FIN }; 48 | \node [roundedblock, below =\smallY of 1_6_1_3] (1_6_1_4) {1.6.1.4 Xmas\\Tree}; 49 | \node [roundedblock, below =\smallY of 1_6_1_4] (1_6_1_5) {1.6.1.5 Null }; 50 | \node [roundedblock, below =\smallY of 1_6_1_5] (1_6_1_6) {1.6.1.6 ACK}; 51 | \node [roundedblock, below =\smallY of 1_6_1_6] (1_6_1_7) {1.6.1.7\\Windows }; 52 | \node [roundedblock, below =\smallY of 1_6_1_7] (1_6_1_8) {1.6.1.8 RPC }; 53 | \node [roundedblock, below left =\smallY and \shiftX*0.6 of 1_6_1_8] (1_6_2) {1.6.2 UDP}; 54 | 55 | \node [roundedblock, below =\largeY*6.5 of 1_5_4_3] (1_7) {1.7 MAC Flooding}; 56 | 57 | \node [block, below =\largeY*6.3 of 1_6] (1_8) {1.8 VLAN Hooping}; 58 | \node [block, below =\largeY*7.3 of 1_5_4_3] (1_8_1) {1.8.1 Switch Spoofing}; 59 | \node [block, below =\smallY of 1_8_1] (1_8_2) {1.8.2 Double Tagging}; 60 | 61 | \node [roundedblock, below right=\largeY*1.7 and \shiftX*0.6 of 1_6_2] (1_9) {1.9 Probing}; 62 | \node [semiroundedblock, below =\largeY*11.8 of 1_2] (1_10) {1.10 nonTor Traffic}; 63 | 64 | \node [semiroundedblock, below =\largeY*11.8 of 1_3_2, minimum width=7.5cm] (1_11) {1.11 Heartbleed}; 65 | 66 | %%%%%%%%%%%%%%%%%%%%% Links %%%%%%%%%%%%%%%%%%%%% 67 | 68 | \draw[->] ($(1_1.south)-(\southXDisplacement, 0)$) |- (1_1_1.west) ; 69 | \draw[->] ($(1_1_1.east)$) -- (1_1_1_1.west) ; 70 | \draw[->] ($(1_1_1.east)+(\southXDisplacement, 0)$) |- (1_1_1_2.west) ; 71 | \draw[->] ($(1_1_1.east)+(\southXDisplacement, 0)$) |- (1_1_1_3.west) ; 72 | \draw[->] ($(1_1_1.east)+(\southXDisplacement, 0)$) |- (1_1_1_4.west) ; 73 | \draw[->] ($(1_1_1.east)+(\southXDisplacement, 0)$) |- (1_1_1_5.west) ; 74 | \draw[->] ($(1_1_1.east)+(\southXDisplacement, 0)$) |- (1_1_1_6.west) ; 75 | 76 | \draw[->] ($(1_1.south)-(\southXDisplacement*1.4, 0)$) |- (1_1_2.west) ; 77 | \draw[->] ($(1_1.south)-(\southXDisplacement*1.4, 0)$) |- (1_1_3.west) ; 78 | \draw[->] ($(1_1_3.east)$) -- (1_1_3_1.west) ; 79 | 80 | \draw[->] ($(1_1.south)-(\southXDisplacement*1.4, 0)$) |- (1_1_4.west) ; 81 | \draw[->] ($(1_1_4.south)-(\southXDisplacement, 0)$) |- (1_1_4_1.west) ; 82 | \draw[->] ($(1_1.south)-(\southXDisplacement*1.4, 0)$) |- (1_1_5.west) ; 83 | 84 | \draw[->] (1_3) -- (1_3_1); 85 | \draw[->] (1_3) |- (1_3_2); 86 | \draw[->] (1_5) -- (1_5_1); 87 | \draw[->] ($(1_5.south)-(\southBorderXDisplacement, 0)$) |- (1_5_2.west) ; 88 | \draw[->] ($(1_5.south)-(\southBorderXDisplacement, 0)$) |- (1_5_3.west) ; 89 | 90 | \draw[->] ($(1_5.south)-(\southBorderXDisplacement, 0)$) |- (1_5_4.west) ; 91 | \draw[->] ($(1_5_4.east)$) -- (1_5_4_1); 92 | \draw[->] ($(1_5_4.south)$) |- (1_5_4_2.west) ; 93 | \draw[->] ($(1_5_4.south)$) |- (1_5_4_3.west) ; 94 | 95 | \draw[->] (1_6) -- (1_6_1); 96 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_1.west) ; 97 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_2.west) ; 98 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_3.west) ; 99 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_4.west) ; 100 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_5.west) ; 101 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_6.west) ; 102 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_7.west) ; 103 | \draw[->] ($(1_6_1.south)-(\southBorderXDisplacement, 0)$) |- (1_6_1_8.west) ; 104 | \draw[->] ($(1_6.south)$) |- (1_6_2.west) ; 105 | 106 | \draw[->] (1_8) -- (1_8_1); 107 | \draw[->] ($(1_8.south)$) |- (1_8_2.west) ; 108 | 109 | \draw[->] ($(1_3.south)-(\southBorderXDisplacement*1.5, 0)$) |- ($(1_5_4_1.west)-(0,0.1)$) ; 110 | \draw[->] ($(1_3.south)-(\southBorderXDisplacement*1.5, 0)$) |- ($(1_5_4_3.west)-(0,0.2)$) ; 111 | \end{tikzpicture} -------------------------------------------------------------------------------- /Taxonomy/2-host_3-software.tex: -------------------------------------------------------------------------------- 1 | \begin{tikzpicture} 2 | 3 | \input{0.1-header} 4 | \input{0.2-vertical-lines} 5 | 6 | %%%%%%%%%%%%%%%%%%%%% Nodes %%%%%%%%%%%%%%%%%%%%% 7 | \node [sectionblock, below right =\smallY and -\headerNodeDistance of TCP] (S2) {2. Host}; 8 | 9 | \node [block, below = \largeY of TCP] (2_1) {2.1 Malware}; 10 | \node [block, below left=\largeY*1.8 and \shiftX of A] (2_1_1) {2.1.1 Trojans}; 11 | \node [block, below right=\smallY and \shiftX*0.8 of 2_1_1] (2_1_1_1) {2.1.1.1 Remote\\Access}; 12 | \node [block, below =\smallY of 2_1_1_1] (2_1_1_2) {2.1.1.2 Sending}; 13 | \node [block, below =\smallY of 2_1_1_2] (2_1_1_3) {2.1.1.3 Destructive}; 14 | \node [block, below =\smallY of 2_1_1_3] (2_1_1_4) {2.1.1.4 Proxy}; 15 | \node [block, below =\smallY of 2_1_1_4] (2_1_1_5) {2.1.1.5 FTP}; 16 | \node [block, below =\smallY of 2_1_1_5] (2_1_1_6) {2.1.1.6 Security\\Software Disable}; 17 | \node [block, below =\smallY of 2_1_1_6] (2_1_1_7) {2.1.1.7 DoS}; 18 | 19 | \node [block, below left =\medY*0.5 and \shiftX*0.8 of 2_1_1_7] (2_1_2) {2.1.2 Worm}; 20 | 21 | \node [block, below =\smallY of 2_1_2] (2_1_3) {2.1.3 Virus}; 22 | 23 | \node [roundedblock, below =\smallY of 2_1_3] (2_1_4) {2.1.4 Adware}; 24 | 25 | \node [roundedblock, below =\smallY of 2_1_4] (2_1_5) {2.1.5 Spyware}; 26 | 27 | \node [block, below =\smallY and of 2_1_5] (2_1_6) {2.1.6 Ransomware}; 28 | 29 | \node [semiroundedblock, below =\smallY and of 2_1_6] (2_1_7) {2.1.7 Camouflage}; 30 | \node [semiroundedblock, below right =\smallY and \shiftX*1.2 of 2_1_7] (2_1_7_1) {2.1.7.1 Self-mutating}; 31 | 32 | \node [semiroundedblock, below=\smallY of 2_1_7_1] (2_2) {2.2 Fuzzers}; 33 | 34 | 35 | \node [sectionblock, below right =\smallY*64 and -\headerNodeDistance of 2_1] (S3) {3. Software}; 36 | 37 | \node [roundedblock, below =\largeY*3.5 of 2_1_6] (3_1) {3.1 Information\\Gathering}; 38 | \node [block, below left =\medY and \shiftX*1.5 of 3_1] (3_2) {3.2 Code-Injection }; 39 | \node [semiroundedblock, below right =\smallY and \shiftX*1.4 of 3_2] (3_2_1) {3.2.1 SQL-Injection}; 40 | \node [semiroundedblock, below =\smallY of 3_2_1] (3_2_2) {3.2.2 Cross Site\\Scripting}; 41 | \node [semiroundedblock, below right =\smallY and \shiftX*1.2 of 3_2_2] (3_2_2_1) {3.2.2.1 Persistent}; 42 | \node [semiroundedblock, below =\smallY of 3_2_2_1] (3_2_2_2) {3.2.2.2 Reflected}; 43 | \node [semiroundedblock, below =\smallY of 3_2_2_2] (3_2_2_3) {3.2.2.3 DOM-\\Based}; 44 | \node [semiroundedblock, below left =\medY*0.5 and \shiftX*0.8 of 3_2_2_3] (3_2_3) {3.2.3 Shellcode}; 45 | 46 | 47 | 48 | %%%%%%%%%%%%%%%%%%%%% Links %%%%%%%%%%%%%%%%%%%%% 49 | \draw[->] (2_1) -- (2_1_1); 50 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_1.west); 51 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_2.west); 52 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_3.west); 53 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_4.west); 54 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_5.west); 55 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_6.west); 56 | \draw[->] ($(2_1_1.south)-(\southXDisplacement, 0)$) |- (2_1_1_7.west); 57 | \draw[->] ($(2_1.south)$) |- (2_1_2.west); 58 | \draw[->] ($(2_1.south)$) |- (2_1_3.west); 59 | \draw[->] ($(2_1.south)$) |- (2_1_4.west); 60 | \draw[->] ($(2_1.south)$) |- (2_1_5.west); 61 | \draw[->] ($(2_1.south)$) |- (2_1_6.west); 62 | \draw[->] ($(2_1.south)$) |- (2_1_7.west); 63 | \draw[->] ($(2_1_7.south)-(\southXDisplacement*1.3, 0)$) |- (2_1_7_1.west); 64 | \draw[->] ($(3_2.south)-(\southBorderXDisplacement, 0)$) |- (3_2_1.west); 65 | \draw[->] ($(3_2.south)-(\southBorderXDisplacement, 0)$) |- (3_2_2.west); 66 | \draw[->] ($(3_2_2.south)-(\southBorderXDisplacement, 0)$) |- (3_2_2_1.west); 67 | \draw[->] ($(3_2_2.south)-(\southBorderXDisplacement, 0)$) |- (3_2_2_2.west); 68 | \draw[->] ($(3_2_2.south)-(\southBorderXDisplacement, 0)$) |- (3_2_2_3.west); 69 | \draw[->] ($(3_2.south)-(\southBorderXDisplacement, 0)$) |- (3_2_3.west); 70 | 71 | 72 | \end{tikzpicture} -------------------------------------------------------------------------------- /Taxonomy/4-physical_5-human.tex: -------------------------------------------------------------------------------- 1 | \begin{tikzpicture} 2 | 3 | \input{0.1-header} 4 | \input{0.2-vertical-lines} 5 | 6 | %%%%%%%%%%%%%%%%%%%%% Nodes %%%%%%%%%%%%%%%%%%%%% 7 | \node [block, below = \largeY of A] (3_3) {3.3 Fingerprinting}; 8 | 9 | \node [block, below =\smallY*1.5 of 3_3] (3_4) {3.4 Misconfiguration}; 10 | 11 | \node [block, below =\largeY*1.8 of P] (3_5) {3.5 Fake Certificates}; 12 | 13 | \node [block, below =\smallY*1.7 of 3_4] (3_6) {3.6 Drive-by Download}; 14 | 15 | \node [sectionblock, below right =\smallY*15 and -\headerNodeDistance of TCP] (S4) {4. Physical}; 16 | 17 | \node [block, below = \largeY*4.2 of H] (4_1) {4.1 Backdoor}; 18 | \node [block, below = \medY of 4_1] (4_2) {4.2 Mis-\\configuration}; 19 | 20 | \node [sectionblock, below left =\medY and -\headerNodeDistance of 4_2] (S5) {5. Human}; 21 | 22 | \node [block, below =\largeY*7.2 of A] (5_1) {5.1 Masquerade}; 23 | 24 | \node [block, below =\medY of 5_1] (5_2) {5.2 Phishing}; 25 | \node [block, below right =\smallY and \shiftX of 5_2] (5_2_1) {5.2.1 Spear\\Phishing}; 26 | 27 | \node [block, below left =\medY and \shiftX of 5_2_1] (5_3) {5.3 U2R}; 28 | 29 | \node [block, below =\medY of 5_3] (5_4) {5.4 R2L}; 30 | 31 | \node [block, below =\medY of 5_4] (5_5) {5.5 Repudiation}; 32 | 33 | \node [block, below =\largeY*12 of S] (5_6) {5.6 Session Hijacking}; 34 | 35 | \node [block, below =\largeY*12.5 of H] (5_7) {5.7 Physical Damage}; 36 | 37 | \node [block, below =\largeY of 5_5] (5_8) {5.8 Fraud}; 38 | 39 | \node [semiroundedblock, below =\largeY*13.3 of TCP] (5_9) {5.9 Brute force}; 40 | 41 | \node [semiroundedblock, below =\medY*1.5 of 5_8] (5_9_1) {5.9.1 SSH}; 42 | \node [semiroundedblock, below =\smallY of 5_9_1] (5_9_2) {5.9.2 FTP}; 43 | %%%%%%%%%%%%%%%%%%%%% Links %%%%%%%%%%%%%%%%%%%%% 44 | \draw[->] ($(5_2.south)-(\southXDisplacement, 0)$) |- (5_2_1.west); 45 | 46 | \draw[->] (5_9.east) |- (5_9_1.west); 47 | \draw[->] (5_9.east) |- (5_9_2.west); 48 | 49 | \end{tikzpicture} -------------------------------------------------------------------------------- /Taxonomy/6-others.tex: -------------------------------------------------------------------------------- 1 | \begin{tikzpicture} 2 | 3 | %%%%%%%%%%%%%%%%%%%%% Nodes %%%%%%%%%%%%%%%%%%%%% 4 | \node [sectionblock] (others) {6. Attacks Unrelated to OSI Model Layers}; 5 | \node [block, below = \medY of others] (6_1) {6.1 Brute Force}; 6 | \node [block, below = \medY of 6_1] (6_2) {6.2 Resource Exhaustion}; 7 | \node [block, below = \medY of 6_2] (6_3) {6.3 Replay}; 8 | \node [block, below = \medY of 6_3] (6_4) {6.4 Metadata Spoofing}; 9 | \node [block, below = \medY of 6_4] (6_5) {6.5 Reverse Engineering}; 10 | 11 | \end{tikzpicture} -------------------------------------------------------------------------------- /Taxonomy/Readme.md: -------------------------------------------------------------------------------- 1 | # Networking Threats Taxonomy 2 | 3 | ## Taxonomy Structure 4 | The taxonomy classifies each network threat according to: 5 | - Its Source (i.e. Networking, Host, Software, Hardware, Human) 6 | - OSI Layer 7 | - Active / Passive 8 | 9 | 10 | ## Taxonomy Samples 11 | 12 | ![Taxonomy_1](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Taxonomy_1.PNG) 13 | ![Taxonomy_2](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Taxonomy_2.PNG) 14 | ![Taxonomy_3](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Taxonomy_3.PNG) 15 | 16 | ## For higher resolution: 17 | - Compile LaTeX files 18 | - Refer to the paper [here](https://arxiv.org/abs/1806.03517). 19 | -------------------------------------------------------------------------------- /Taxonomy/additional_ref.bib: -------------------------------------------------------------------------------- 1 | @article{al2018survey, 2 | title={A Survey of Machine and Deep Learning Methods for Internet of Things (IoT) Security}, 3 | author={Al-Garadi, Mohammed Ali and Mohamed, Amr and Al-Ali, Abdulla and Du, Xiaojiang and Guizani, Mohsen}, 4 | journal={arXiv preprint arXiv:1807.11023}, 5 | year={2018} 6 | } 7 | 8 | 9 | @inproceedings{bakhshi2018industrial, 10 | title={Industrial IoT security threats and concerns by considering Cisco and Microsoft IoT reference models}, 11 | author={Bakhshi, Zeinab and Balador, Ali and Mustafa, Jawad}, 12 | booktitle={Wireless Communications and Networking Conference Workshops (WCNCW), 2018 IEEE}, 13 | pages={173--178}, 14 | year={2018}, 15 | organization={IEEE} 16 | } -------------------------------------------------------------------------------- /Tools/Readme.md: -------------------------------------------------------------------------------- 1 | # Tools 2 | The threats are associated with the tools used to carry the attacks. 3 | 4 | 5 | ## Sample 6 | 7 | ![Tools](https://github.com/AbertayMachineLearningGroup/network-threats-taxonomy/blob/master/images/Tools.PNG) 8 | 9 | ## For higher resolution: 10 | - Compile LaTeX file 11 | - Refer to the paper [here](https://arxiv.org/abs/1806.03517). 12 | -------------------------------------------------------------------------------- /Tools/main.tex: -------------------------------------------------------------------------------- 1 | \documentclass[a3paper]{article} 2 | \usepackage[utf8]{inputenc} 3 | \usepackage[margin=0.8in]{geometry} 4 | 5 | \usepackage{tikz} 6 | \usetikzlibrary{arrows,positioning,shapes.geometric,calc, shapes, shapes.gates.logic.US} 7 | 8 | \title{Attack Tools} 9 | 10 | \tikzset{ 11 | headerblock/.style= {draw=none, rectangle, align=center,minimum width=2.5cm,minimum height=0.75cm, fill=gray!30, font=\bf}, 12 | block/.style= {draw, rectangle, align=center,minimum width=2.4cm,minimum height=0.5cm, font=\bfseries} 13 | } 14 | 15 | \def \largeX {18cm} 16 | \def \smallY {0.13cm} 17 | 18 | \begin{document} 19 | \vspace{10mm} 20 | \begin{tikzpicture} 21 | %%%%%%%%%%%%%%%%%%%%% Left Column %%%%%%%%%%%%%%%%%%%%% 22 | \node [block] (1) {HULK}; 23 | \node [block, below = \smallY of 1] (2) {XOIC}; 24 | \node [block, below = \smallY of 2] (3) {DDOSIM}; 25 | \node [block, below = \smallY of 3] (4) {PyLoris}; 26 | \node [block, below = \smallY of 4] (5) {GoldenEye}; 27 | \node [block, below = \smallY of 5] (6) {OWASP HTTP DoS}; 28 | \node [block, below = \smallY of 6] (7) {HOIC}; 29 | \node [block, below = \smallY of 7] (8) {LOIC}; 30 | \node [block, below = \smallY of 8] (9) {R.U.D.Y.}; 31 | \node [block, below = \smallY of 9] (10) {SlowLoris}; 32 | \node [block, below = \smallY of 10] (11) {Jolt2}; 33 | \node [block, below = \smallY of 11] (12) {Nemesy}; 34 | \node [block, below = \smallY of 12] (13) {Panther2}; 35 | \node [block, below = \smallY of 13] (14) {Blast20}; 36 | \node [block, below = \smallY of 14] (15) {UDP Flood}; 37 | \node [block, below = \smallY of 15] (16) {FSMax}; 38 | \node [block, below = \smallY of 16] (17) {Some Trouble}; 39 | \node [block, below = \smallY of 17] (18) {BlackEnergy}; 40 | \node [block, below = \smallY of 18] (19) {\#RefRef}; 41 | \node [block, below = \smallY of 19] (20) {Bubonic.c}; 42 | \node [block, below = \smallY of 20] (21) {Stacheldrath}; 43 | \node [block, below = \smallY of 21] (22) {Crazy Pinger}; 44 | \node [block, below = \smallY of 22] (23) {Shaft}; 45 | \node [block, below = \smallY of 23] (24) {Knight}; 46 | \node [block, below = \smallY of 24] (25) {Targa}; 47 | \node [block, below = \smallY of 25] (26) {hping}; 48 | \node [block, below = \smallY of 26] (27) {Hgod}; 49 | \node [block, below = \smallY of 27] (28) {TFN}; 50 | \node [block, below = \smallY of 28] (29) {Trinoo}; 51 | \node [block, below = \smallY of 29] (30) {Land and LaTierra}; 52 | \node [block, below = \smallY of 30] (31) {T50}; 53 | 54 | 55 | 56 | \node [block, below = \smallY*5 of 31] (101) {Packeth}; 57 | \node [block, below = \smallY of 101] (102) {Packit}; 58 | \node [block, below = \smallY of 102] (103) {Scapy}; 59 | \node [block, below = \smallY of 103] (104) {packet excalibur}; 60 | \node [block, below = \smallY of 104] (105) {Nemesis}; 61 | \node [block, below = \smallY of 105] (106) {Tcpinject}; 62 | \node [block, below = \smallY of 106] (107) {Libnet}; 63 | \node [block, below = \smallY of 107] (108) {SendIP}; 64 | \node [block, below = \smallY of 108] (109) {IP sorcery}; 65 | \node [block, below = \smallY of 109] (110) {Pacgen}; 66 | \node [block, below = \smallY of 110] (111) {ARP-SK}; 67 | \node [block, below = \smallY of 111] (112) {ARPspoof}; 68 | \node [block, below = \smallY of 112] (113) {dnet}; 69 | \node [block, below = \smallY of 113] (114) {dpkt}; 70 | \node [block, below = \smallY of 114] (115) {irpas}; 71 | \node [block, below = \smallY of 115] (116) {Libpal}; 72 | \node [block, below = \smallY of 116] (117) {Aicmpsend}; 73 | 74 | \node [block, below = \smallY*5 of 117] (201) {Caffe-Latte}; 75 | \node [block, below = \smallY of 201] (202) {Wep0ff}; 76 | 77 | 78 | 79 | 80 | % \node [block, below = \smallY of a40] (a41) {Hirte}; 81 | % \node [block, below = \smallY of a41] (a42) {EvilTwin}; 82 | 83 | 84 | % %%%%%%%%%%%%%%%%%%%%% Right Column %%%%%%%%%%%%%%%%%%%%% 85 | \node [block, right=\largeX of 1] (401) {Tcpdump}; 86 | \node [block, below = \smallY of 401] (402) {WinDump}; 87 | \node [block, below = \smallY of 402] (403) {Wireshark}; 88 | \node [block, below = \smallY of 403] (404) {Net2pcap}; 89 | \node [block, below = \smallY of 404] (405) {Snoop}; 90 | \node [block, below = \smallY of 405] (406) {Angst}; 91 | \node [block, below = \smallY of 406] (407) {Ngrep}; 92 | \node [block, below = \smallY of 407] (408) {Ettercap}; 93 | \node [block, below = \smallY of 408] (409) {Dsniff}; 94 | \node [block, below = \smallY of 409] (410) {Cain and Abel}; 95 | \node [block, below = \smallY of 410] (411) {Tcptrace}; 96 | \node [block, below = \smallY of 411] (412) {Tcptrack}; 97 | \node [block, below = \smallY of 412] (413) {Maltego}; 98 | \node [block, below = \smallY of 413] (414) {Nfdump}; 99 | 100 | 101 | \node [block, below = \smallY*5 of 414] (501) {P0f}; 102 | \node [block, below = \smallY of 501] (502) {Xprobe}; 103 | \node [block, below = \smallY of 502] (503) {NetworkMiner}; 104 | \node [block, below = \smallY of 503] (504) {Masscan}; 105 | \node [block, below = \smallY of 504] (505) {SinFP}; 106 | \node [block, below = \smallY of 505] (506) {NetSleuth}; 107 | 108 | %DNS, SSH & SSL 109 | \node [block, below = \smallY of 506] (507) {Fpdns}; 110 | \node [block, below = \smallY of 507] (508) {Hassh}; 111 | \node [block, below = \smallY of 508] (509) {JA3}; 112 | 113 | %SQL 114 | \node [block, below = \smallY*5 of 509] (601) {SQLMap}; 115 | \node [block, below = \smallY of 601] (602) {NoSQLMap}; 116 | \node [block, below = \smallY of 602] (603) {Blisqy}; 117 | \node [block, below = \smallY of 603] (604) {jSQL Injection}; 118 | \node [block, below = \smallY of 604] (605) {Whitewidow}; 119 | 120 | 121 | %Scannign 122 | \node [block, below = \smallY*5 of 605] (301) {Nmap}; 123 | \node [block, below = \smallY of 301] (302) {Amap}; 124 | \node [block, below = \smallY of 302] (303) {Angry IP Scan}; 125 | \node [block, below = \smallY of 303] (304) {SolarWinds Port Scanner}; 126 | \node [block, below = \smallY of 304] (305) {Advanced IP Scanner}; 127 | \node [block, below = \smallY of 305] (306) {LanSweeper IP Scanner}; 128 | \node [block, below = \smallY of 306] (307) {Slitheris}; 129 | \node [block, below = \smallY of 307] (308) {Unicornscan}; 130 | \node [block, below = \smallY of 308] (309) {IKE-scan}; 131 | \node [block, below = \smallY of 309] (310) {Paketto}; 132 | \node [block, below = \smallY of 310] (311) {strobe}; 133 | \node [block, below = \smallY of 311] (312) {Zenmap}; 134 | \node [block, below = \smallY of 312] (313) {Nikto}; 135 | \node [block, below = \smallY of 313] (314) {OpenVAS}; 136 | \node [block, below = \smallY of 314] (315) {Wapiti}; 137 | \node [block, below = \smallY of 315] (316) {Netcat}; 138 | 139 | 140 | 141 | %%%%%%%%%%%%%%%%%%%%% Attacks %%%%%%%%%%%%%%%%%%%%% 142 | \node [headerblock, right = \largeX/4 of 1, minimum width = 10cm] (attacks) {\textbf{Attack Tools}}; 143 | \node [block, below left = \smallY*10 and \smallY*-10 of attacks] (dos) {DoS\\DDoS}; 144 | \node [block, below right = \smallY*10 and \smallY*-12 of attacks] (info) {Information\\Gathering}; 145 | \node [block, below right = \smallY*135 and \smallY*-20 of attacks] (sql) {Sql Injection}; 146 | \node [block, block, below left = \smallY*200 and \smallY*-18 of attacks] (forging) {Packet Forging}; 147 | \node [block, block, below right = \smallY*85 and \smallY*-20 of attacks] (fingerprinting) {Fingerprinting}; 148 | \node [block, block, below left = \smallY*250 and \smallY*-5 of attacks] (impersonate) {Impersonate}; 149 | \node [block, block, below right = \smallY*200 and \smallY*-20 of attacks] (scanning) {Scanning}; 150 | 151 | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 152 | % %%%%%%%%%%%%%%%%%%%%% Links %%%%%%%%%%%%%%%%%%%%% 153 | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 154 | 155 | %DoS 156 | \foreach \x in {1,...,31} 157 | \draw[->] (dos.west) -- ($(dos.west) - (1, 0)$) |- (\x.east); 158 | 159 | % info gathering 160 | \foreach \x in {401,...,414} 161 | \draw[->] (info.east) -- ($(info.east) - (-1.5, 0)$) |- (\x.west); 162 | 163 | 164 | % forging 165 | \foreach \x in {101,...,117} 166 | \draw[->] (forging.west) -- ($(forging.west) - (1, 0)$) |- (\x.east); 167 | 168 | % impersonate 169 | \foreach \x in {201,...,202} 170 | \draw[->] (impersonate.west) -- ($(impersonate.west) - (1, 0)$) |- (\x.east); 171 | 172 | % scanning 173 | \foreach \x in {301,...,316} 174 | \draw[->] (scanning.east) -- ($(scanning.east) - (-1.51, 0)$) |- (\x.west); 175 | 176 | 177 | 178 | % fingerprinting 179 | \foreach \x in {501,...,506} 180 | \draw[->] (fingerprinting.east) -- ($(fingerprinting.east) - (-1.5, 0)$) |- (\x.west); 181 | 182 | % sql 183 | \foreach \x in {601,...,605} 184 | \draw[->] (sql.east) -- ($(sql.east) - (-1.5, 0)$) |- (\x.west); 185 | 186 | \draw[->] (forging.west) -- ($(forging.west) - (1, 0)$) |- ($(26.east) - (0,0.1)$); 187 | \draw[->] (forging.east) -- ($(forging.east) - (-1, 0)$) |- ($(410.west) - (0,0.1)$); 188 | 189 | \draw[->] (scanning.west) -- ($(scanning.west) - (1, 0)$) |- (26.east); 190 | 191 | \draw[->] (impersonate.east) -- ($(impersonate.east) - (-3, 0)$) |- ($(410.west) + (0,0.1)$); 192 | 193 | \draw[->] (fingerprinting.west) -- ($(fingerprinting.west) - (1, 0)$) |- ($(26.east) + (0,0.1)$); 194 | \draw[->] (fingerprinting.west) -- ($(fingerprinting.west) - (0.8, 0)$) |- ($(301.west) + (0,0.1) $); 195 | \draw[->] (fingerprinting.east) -- ($(fingerprinting.east) - (-1.5, 0)$) |- (408.west); 196 | 197 | 198 | \end{tikzpicture} 199 | \end{document} 200 | 201 | -------------------------------------------------------------------------------- /images/Taxonomy_1.PNG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/AbertayMachineLearningGroup/network-threats-taxonomy/4ae4ad8791878b50043193b4136034349fec88c1/images/Taxonomy_1.PNG -------------------------------------------------------------------------------- /images/Taxonomy_2.PNG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/AbertayMachineLearningGroup/network-threats-taxonomy/4ae4ad8791878b50043193b4136034349fec88c1/images/Taxonomy_2.PNG -------------------------------------------------------------------------------- /images/Taxonomy_3.PNG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/AbertayMachineLearningGroup/network-threats-taxonomy/4ae4ad8791878b50043193b4136034349fec88c1/images/Taxonomy_3.PNG -------------------------------------------------------------------------------- /images/Tools.PNG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/AbertayMachineLearningGroup/network-threats-taxonomy/4ae4ad8791878b50043193b4136034349fec88c1/images/Tools.PNG --------------------------------------------------------------------------------