The security risk of a network against unknown zero day attacks has been considered as something unmeasurable since software flaws are less predictable than hardware faults and the process of finding such flaws and developing exploits seems to be chaotic . In this paper, we propose a novel security metric, k-zero day safety, based on the number of unknown zero day vulnerabilities. That is, the metric simply counts how many unknown vulnerabilities would be required for compromising a network asset, regardless of what vulnerabilities those might be. We formally define the metric based on an abstract model of networks and attacks. We then devise algorithms for computing the metric. Finally, we show the metric can quantify many existing practices in hardening a network.
Proceedings Title: Computer Security ESORICS 2010 (Lecture Notes in Computer Science)
Conference Dates: September 20-22, 2010
Conference Location: Athens, -1
Conference Title: 15th European Symposium on Research in Computer Security (ESORICS 2010)
Pub Type: Conferences
attack graphs, network security, security metrics