The Community for Technology Leaders
Green Image
Issue No. 01 - Jan.-Feb. (2014 vol. 11)
ISSN: 1545-5971
pp: 30-44
Lingyu Wang , Concordia University, Montreal
Sushil Jajodia , George Mason University, Fairfax
Anoop Singhal , National Institute of Standards and Technology, Gaithersburg
Pengsu Cheng , Concordia University, Montreal
Steven Noel , George Mason University, Fairfax
By enabling a direct comparison of different security solutions with respect to their relative effectiveness, a network security metric may provide quantifiable evidences to assist security practitioners in securing computer networks. However, research on security metrics has been hindered by difficulties in handling zero-day attacks exploiting unknown vulnerabilities. In fact, the security risk of unknown vulnerabilities has been considered as something unmeasurable due to the less predictable nature of software flaws. This causes a major difficulty to security metrics, because a more secure configuration would be of little value if it were equally susceptible to zero-day attacks. In this paper, we propose a novel security metric, $(k)$-zero day safety, to address this issue. Instead of attempting to rank unknown vulnerabilities, our metric counts how many such vulnerabilities would be required for compromising network assets; a larger count implies more security because the likelihood of having more unknown vulnerabilities available, applicable, and exploitable all at the same time will be significantly lower. We formally define the metric, analyze the complexity of computing the metric, devise heuristic algorithms for intractable cases, and finally demonstrate through case studies that applying the metric to existing network security practices may generate actionable knowledge.
network hardening, Security metrics, network security, attack graph
Lingyu Wang, Sushil Jajodia, Anoop Singhal, Pengsu Cheng, Steven Noel, "k-Zero Day Safety: A Network Security Metric for Measuring the Risk of Unknown Vulnerabilities", IEEE Transactions on Dependable and Secure Computing, vol. 11, no. , pp. 30-44, Jan.-Feb. 2014, doi:10.1109/TDSC.2013.24
103 ms
(Ver 3.3 (11022016))