all InfoSec news
Attack time analysis in dynamic attack trees via integer linear programming. (arXiv:2111.05114v2 [cs.CR] UPDATED)
cs.CR updates on arXiv.org arxiv.org
Attack trees are an important tool in security analysis, and an important
part of attack tree analysis is computing metrics. This paper focuses on
dynamic attack trees and their min time metric, i.e. the minimal time to attack
a system. For general attack trees, calculating min time efficiently is an open
problem, with the fastest current method being enumerating all minimal attacks,
which is NP-hard. This paper presents three tools for calculating min time.
First, we introduce a novel method …
analysis attack attacks computing current dynamic general hard important integer metrics problem programming security security analysis system tool trees