分层网络安全系统建模的带根加权树结构与拓扑
The structure and topology of rooted weighted trees modeling layered cyber-security systems
摘要:
在本文中,我们考虑一个分层的安全模型,其中的容器和它们的嵌套的形式给出了一个根树$T$。{ \em网络安全模型\/}是一个有序的三元组$M = (T, C, P)$,其中$C$和$P$分别是容器的{ \em渗透成本\/}和位于容器内的奖品的{ \em目标获取值\/}的多集合,两者都具有与$T$的非根顶点集合相同的基数。我们研究的问题是分配渗透成本的边缘和目标采集值的树$T$的顶点,以这样的方式,最大限度地减少总奖金,攻击者可以获得有限的{ \em预算}。对于给定的分配成本和目标值,我们得到一个{ \em安全系统},我们讨论了三种类型的他们:{ \em改进},{ \em好},和{ \em最佳}。我们表明,在一般情况下,它是不可能开发一个最佳的安全系统,为一个给定的网络安全模型$M$。我们定义的P-和C-模型的渗透成本和奖金,分别都有单位价值。我们证明了如果$T$是一棵有根树,使得任何P-或C-模型$M = (T,C,P)$都有一个最优安全系统,那么$T$是以下类型之一:(i)有根路径,(ii)有根星,(iii)有根3-毛虫,或(iv)有根4-蜘蛛。相反,如果$T$是这四种类型的树之一,那么我们证明了任何P-或C-模型$M = (T,C,P)$都有一个最优的安全系统。最后,我们研究了P-和C-模型之间的对偶性,使我们能够将P-模型的结果转化为C-模型的相应结果,反之亦然。所获得的结果给了我们一些数学见解分层安全防御应该如何组织。
英文摘要:
In this paper we consider a layered-security model in which the containers and their nestings are given in the form of a rooted tree $T$. A {\em cyber-security model\/} is an ordered three-tuple $M = (T, C, P)$ where $C$ and $P$ are multisets of {\em penetration costs\/} for the containers and {\em target-acquisition values\/} for the prizes that are located within the containers, respectively, both of the same cardinality as the set of the non-root vertices of $T$. The problem that we study is to assign the penetration costs to the edges and the target-acquisition values to the vertices of the tree $T$ in such a way that minimizes the total prize that an attacker can acquire given a limited {\em budget}. For a given assignment of costs and target values we obtain a {\em security system}, and we discuss three types of them: {\em improved}, {\em good}, and {\em optimal}. We show that in general it is not possible to develop an optimal security system for a given cyber-security model $M$. We define P- and C-models where the penetration costs and prizes, respectively, all have unit value. We show that if $T$ is a rooted tree such that any P- or C-model $M = (T,C,P)$ has an optimal security system, then $T$ is one of the following types: (i) a rooted path, (ii) a rooted star, (iii) a rooted 3-caterpillar, or (iv) a rooted 4-spider. Conversely, if $T$ is one of these four types of trees, then we show that any P- or C-model $M = (T,C,P)$ does have an optimal security system\@. Finally, we study a duality between P- and C-models that allows us to translate results for P-models into corresponding results for C-models and vice versa. The results obtained give us some mathematical insights into how layered-security defenses should be organized.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。