2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) (2014)
Atlanta, GA, USA
June 23, 2014 to June 26, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2014.68
Computing a prioritized set of vulnerabilities to patch is important for system administrators to determine the order of vulnerabilities to be patched that are more critical to the network security. One way to assess and analyze security to find vulnerabilities to be patched is to use attack representation models (ARMs). However, security solutions using ARMs are optimized for only the current state of the networked system. Therefore, the ARM must reanalyze the network security, causing multiple iterations of the same task to obtain the prioritized set of vulnerabilities to patch. To address this problem, we propose to use importance measures to rank network hosts and vulnerabilities, then combine these measures to prioritize the order of vulnerabilities to be patched. We show that nearly equivalent prioritized set of vulnerabilities can be computed in comparison to an exhaustive search method in various network scenarios, while the performance of computing the set is dramatically improved, while equivalent solutions are computed in various network scenarios.
Security, Measurement, Computational modeling, Equations, Mathematical model, Scalability, Analytical models
J. B. Hong, D. S. Kim and A. Haqiq, "What Vulnerability Do We Need to Patch First?," 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Atlanta, GA, USA, 2014, pp. 684-689.