网络的可证安全性
Provable Security of Networks
摘要:
分别针对蓄意攻击和随机错误的级联失效模型,提出了网络的{\it安全性}和{ \it鲁棒性}的定义,研究了网络的安全性和鲁棒性原理.我们提出了一个{ \it安全模型},使得由该模型构造的网络在级联故障模型下可证明安全,同时遵循幂律,并具有小世界性质,并具有时间复杂$O(\log n)$的导航算法.结果表明,对于由该安全模型构造的任意网络$G$,$G$满足一些显著的拓扑性质,包括:(i){ \it小群落现象},即,$G$富含$X$形式的群落,其大小为$\log n$中的多对数,对于某些常数$β$,电导以$O(\frac{1}{|X|^β})$为界,(ii)小直径性质,其中直径$O(\log n)$允许通过$O(\log n)$时间算法进行导航以找到任意给定的两个节点的路径,以及(iii)幂律分布,并且满足一些概率和组合原理,包括{ \it度优先定理}和{ \it感染包含定理}。通过使用这些原则,我们证明了一个网络$G$构造的安全模型是安全的任何小规模的攻击下的均匀阈值和随机阈值级联故障模型。我们的安全性定理表明,从安全模型构建的网络是可证明的安全,对任何小规模的攻击,其中自然选择{ \it同源性,随机性}和{ \it优先连接}的基本机制。
英文摘要:
We propose a definition of {\it security} and a definition of {\it robustness} of networks against the cascading failure models of deliberate attacks and random errors respectively, and investigate the principles of the security and robustness of networks. We propose a {\it security model} such that networks constructed by the model are provably secure against any attacks of small sizes under the cascading failure models, and simultaneously follow a power law, and have the small world property with a navigating algorithm of time complex $O(\log n)$. It is shown that for any network $G$ constructed from the security model, $G$ satisfies some remarkable topological properties, including: (i) the {\it small community phenomenon}, that is, $G$ is rich in communities of the form $X$ of size poly logarithmic in $\log n$ with conductance bounded by $O(\frac{1}{|X|^β})$ for some constant $β$, (ii) small diameter property, with diameter $O(\log n)$ allowing a navigation by a $O(\log n)$ time algorithm to find a path for arbitrarily given two nodes, and (iii) power law distribution, and satisfies some probabilistic and combinatorial principles, including the {\it degree priority theorem}, and {\it infection-inclusion theorem}. By using these principles, we show that a network $G$ constructed from the security model is secure for any attacks of small scales under both the uniform threshold and random threshold cascading failure models. Our security theorems show that networks constructed from the security model are provably secure against any attacks of small sizes, for which natural selections of {\it homophyly, randomness} and {\it preferential attachment} are the underlying mechanisms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。