论文标题
网络信息理论安全
Network Information Theoretic Security
论文作者
论文摘要
香农（Shannon）表明，要在点对点通信中获得完美的保密性，消息率不能超过共享的秘密密钥率，从而导致简单的一次性垫加密方案。在本文中，我们将此工作从点对点扩展到网络。我们考虑一个连接的网络，并在节点之间具有成对通信。我们假设在沟通开始之前，为每个节点提供了一定数量的秘密位。具有无限计算能力的窃听器可以访问所有通信，并且可以破解其余节点不知道的节点的子集。我们研究了该网络的信息理论安全通信的限制。我们在安全的通道速率（对于节点对）和安全网络速率（总和所有节点对速率）之间建立了权衡，并表明只有当没有任何未经包装的通道的任何子集的总和率不超过这些通道的共享未经分配的固定率时，才能实现完美的保密。我们还提出了两种实用和高效的方案，这些方案可以在网络和渠道速度良好的情况下保持良好的平衡，并提供完美的保证。这项工作具有多种潜在的应用程序，需要为这些应用程序提供完美的保密性，例如网络物理系统，分布式控制系统和临时网络。
Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from point-to-point to networks. We consider a connected network with pairwise communication between the nodes. We assume that each node is provided with a certain amount of secret bits before communication commences. An eavesdropper with unlimited computing power has access to all communication and can hack a subset of the nodes not known to the rest of the nodes. We investigate the limits on information-theoretic secure communication for this network. We establish a tradeoff between the secure channel rate (for a node pair) and the secure network rate (sum over all node pair rates) and show that perfect secrecy can be achieved if and only if the sum rate of any subset of unhacked channels does not exceed the shared unhacked-secret-bit rate of these channels. We also propose two practical and efficient schemes that achieve a good balance of network and channel rates with perfect secrecy guarantee. This work has a wide range of potential applications for which perfect secrecy is desired, such as cyber-physical systems, distributed-control systems, and ad-hoc networks.
