2019
DOI: 10.1007/s11235-019-00616-1
|View full text |Cite
|
Sign up to set email alerts
|

Toward an integrated dynamic defense system for strategic detecting attacks in cloud networks using stochastic game

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 16 publications
0
9
0
Order By: Relevance
“…(1) Reconnaissance attacks have technical advantage [20]. Network scanning techniques and tools, such as the ICMP ping and the NMap, provide the attacker with mature tactics to study information and configuration (i.e., IP blocks, OS fingerprinting, and software vulnerabilities).…”
Section: Reconnaissance Attacks In the Cloud Tenant Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…(1) Reconnaissance attacks have technical advantage [20]. Network scanning techniques and tools, such as the ICMP ping and the NMap, provide the attacker with mature tactics to study information and configuration (i.e., IP blocks, OS fingerprinting, and software vulnerabilities).…”
Section: Reconnaissance Attacks In the Cloud Tenant Networkmentioning
confidence: 99%
“…Game theory and attack graphs are often studied in developing the deception strategy [30]. In defending cloud networks, Kandoussi et al [20] used stochastic games to allocate honeypots and detect stealthy attackers. Almohri et al [31] developed a digraph-based strategy to place fake services in the cloud to delay remote attackers.…”
Section: Defensive Deception For the Cloudmentioning
confidence: 99%
“…e attacker and defender enter a stalemate stage at t ∈ [7, 63], both adopt medium-intensity strategies, and both can achieve a balance between attack and defense. At t ∈ [22,26], the attacker attempts a high-intensity attack. Although the defender adopts certain countermeasures, it is successfully attacked, and some normal nodes are infected.…”
Section: Trajectory Analyses Of Optimal Dynamic Strategies Of the Attacker And Defendermentioning
confidence: 99%
“…(2) It can be seen from Figure 3 that, in the case of relatively weak random disturbances, the trajectories of the dynamic strategies of the attacker and defender are similar to those without random disturbance. e defense stage exists at t ∈ [0, 7], the stalemate stage at t ∈ [7,26], and the penetration stage at t > 26 s. e main intensities of strategies in the defense, stalemate, and penetration stages are high, medium, and low, respectively. However, under the influence of random factors, the elapsed time of stalemate is significantly reduced, from 56 s to 19 s. In this stage, the two sides have achieved certain results.…”
Section: Trajectory Analyses Of Optimal Dynamic Strategies Of the Attacker And Defendermentioning
confidence: 99%
See 1 more Smart Citation