An Attack Graph-Based Probabilistic Computing Approach of Network Security

摘要: To protect critical resources in networked environments,it is important to quantify the likelihood of potential multi-step attacks attack graphs.Aimed at problems that difficulty understand graphs and probabilistic re-computing caused by cyclic paths incorrect computing shared dependencies exploits,a methodology for security risk analysis based on model Common Vulnerability Scoring System(CVSS)is presented,attack graph simplified removing unreachable paths,and problem solved avoided successfully proposing concept approach maximum reachable probability which can be adapted a large-scale network,reasonableness effectiveness proposed method verified real experiment simulation.Compared with related research,maximum more complex graph,and have good scalability.