Real-Time Multistep Attack Prediction Based on Hidden Markov Models
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
A novel method based on the Hidden Markov Model is proposed to predict multistep attacks using IDS alerts. We consider the hidden states as similar phases of a particular type of attack. As a result, it can be easily adapted to multistep attacks and foresee the next steps of an attacker. To achieve this goal, a preliminary off-line training phase based on observations will be required. These observations are obtained by matching the IDS alert information with a database previously built for this purpose using a clusterization method from the CVE global database to avoid overfitting. The training model is performed using both unsupervised and supervised algorithms. Once the training is completed and probability matrices are computed, the prediction module compute the best state sequence based on the state probability for each step of the multistep attack in progress using the Viterbi and forward-backward algorithms. The training model includes the mean number of alerts and the number of alerts in progress to assist in obtaining the final attack probability. The model is analyzed for DDoS phases because it is a great problem in all Internet services. The proposed method is validated into a virtual DDoS scenario using current vulnerabilities. The results proving the system's ability to perform real-time prediction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An efficient forward-backward algorithm for an explicit-duration hidden Markov model
Yu, S.-Z., & Kobayashi, H. (2003) · IEEE Signal Processing Letters · doi:10.1109/lsp.2002.806705 · Cited by 226 · cited 2×
“There are three basic problems related to HMMs [6]: Problem 1 Efficiently calculating the observation sequence probability, P ðOj Þ, using the Forward-Backward algorithm [28].”
Method
Cited by
Introduction to Machine Learning
Yu, F. R., & He, Y. (2019) · SpringerBriefs in Electrical and Computer Engineering · doi:10.1007/978-3-030-10546-4_1 · Cited by 1,594
Xie, J., Yu, F. R., Huang, T., Xie, R., Liu, J., Wang, C., & Liu, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2866942 · Cited by 700
“The memoryless property of Markov models means that the conditional probability distribution of future states only relates to the value of the current state and is independent of all previous states [115], [116].”
BackgroundApplications of artificial intelligence for disaster management
Sun, W., Bocchini, P., & Davison, B. D. (2020) · Natural Hazards · doi:10.1007/s11069-020-04124-3 · Cited by 491
Girdhar, M., Hong, J., Lee, H., & Song, T.-J. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2021.3122106 · Cited by 76
“In our case, a supervised algorithm is applied (due to its advantages over unsupervised training) to train the HMM by running multiple iterations until the model converges to a critical point [30].”
Method
Metadata
- Authors
- Holgado, P., Villagra, V. A., & Vazquez, L.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2020-01-01
- Volume
- 17
- Issue
- 1
- Pages
- 134-147
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W2755588949
- Cited by
- 123
- References
- 1
- FWCI
- 6.79
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.