arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.3617cs.ITcs.NImath.IT
收藏

大规模网络中的无线安全

Wireless Secrecy in Large-Scale Networks

Pedro C. Pinto, Joao Barros, Moe Z. Win

摘要:

交换秘密信息的能力对许多商业、政府和军事网络至关重要。本质安全通信图(iS-图)是一个随机图,它描述了可以通过利用无线介质的物理属性在大规模网络上安全建立的连接。本文概述了这类新的随机图的主要性质。我们首先分析了IS-图的局部性质,即度分布及其对衰落、目标保密率和窃听者勾结的依赖性。为了减轻窃听者的影响,我们提出了两种技术,提高安全连接。然后,我们分析了IS-图的全局性质,即无限平面上的渗流性和有限区域上的全连通性。这些结果有助于澄清窃听者的存在如何危及大规模网络中的安全通信。

英文摘要:

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion. To mitigate the effect of the eavesdroppers, we propose two techniques that improve secure connectivity. Then, we analyze the global properties of the iS-graph, namely percolation on the infinite plane, and full connectivity on a finite region. These results help clarify how the presence of eavesdroppers can compromise secure communication in a large-scale network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑