2020
DOI: 10.1016/j.future.2020.01.032
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and detection of the multi-stages of Advanced Persistent Threats attacks based on semi-supervised learning and complex networks characteristics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
37
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 63 publications
(37 citation statements)
references
References 33 publications
0
37
0
Order By: Relevance
“…The studies [3][4][5] analyzed a number of difficulties and challenges that made APT attack detections were not highly efficient including the lack of public data on the APT attacks, the data imbalance, using standard coding protocols, etc. Besides, APT attacks are designed specifically for each specific target and object, so if rely on the experience and data of single attacks, it will not be able to detect new attacks.…”
Section: Survey About Apt Attack Detection Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…The studies [3][4][5] analyzed a number of difficulties and challenges that made APT attack detections were not highly efficient including the lack of public data on the APT attacks, the data imbalance, using standard coding protocols, etc. Besides, APT attacks are designed specifically for each specific target and object, so if rely on the experience and data of single attacks, it will not be able to detect new attacks.…”
Section: Survey About Apt Attack Detection Modelsmentioning
confidence: 99%
“…This is shown in its persistence and ability to conceal and hide [1,2]. The studies [1][2][3][4] presented the definitions and concepts of terms: Advanced, Persistent, and Threat in this attack technique. Moreover, the studies [1,2] pointed 4 characteristics that highlight the difference between APT attack and other network attack techniques including Targeted, Persistent, Evasive, and Complex.…”
Section: Introduction To Apt Attackmentioning
confidence: 99%
“…where α 2 tr W T HLH T W denotes the graph regularization term, W 2 1 is the l 1 norm regularization, and α is a trade-off parameter. The solution for W as follows:…”
Section: B Semi-supervised Extreme Learning Machine (Sselm)mentioning
confidence: 99%
“…Ξ ∈ R n×n is a matrix with all elements as 1. The last term β X − XS 2 F is the data self-representativeness constraint that is useful for the affinity matrix estimation. To solve Eq.…”
Section: Non-negative Sparse Graph Framework (Nnsg)mentioning
confidence: 99%
See 1 more Smart Citation