通过时间依赖性实现通信安全
Communication Security via Temporal Dependency
AI总结：
研究在诸多实际无线场景无法保证传统通信安全资源的情况下，提出利用时间依赖性的通信安全范式，开发状态链随机线性网络编码框架，分析相关特性并制定策略，实现亚秒级窃听者异步。
AI中文摘要：
传统上，通信安全基于共享密钥或相对于窃听者的通信优势这两种外部资源之一构建。然而，许多实际无线场景，包括无基础设施、应急和高度动态的网络，无法保证这两种资源，因此需要新的通信安全原则。本文引入了一种利用时间依赖性作为安全资源的新通信安全范式。与传统保密技术不同，该范式允许数据包解码，但通过使原始数据包和虚拟数据包在计算上不可区分来防止正确解读。它将连续传输有意耦合，使未来通信依赖于正确解读先前传输。作为一种实现方式，开发了状态链随机线性网络编码框架，其中解释每个传输块所需的同步状态嵌入在前一个块中。分析了窃听者异步的概率、持续性以及重新同步的计算复杂度，并基于发射功率和有意干扰优化制定了传输策略。数值结果表明，在无信道优势、无秘密假设、完全协议知识且窃听者任意强大的最坏情况对抗模型下，窃听者异步可在亚秒级实现。
英文摘要：
Communication security has traditionally been built upon one of two external resources: shared secret keys or a communication advantage over the eavesdropper. However, many practical wireless scenarios, including infrastructure-less, emergency, and highly dynamic networks, cannot guarantee either resource, motivating the need for a new communication security principle. This paper introduces a new communication security paradigm that exploits temporal dependency as a security resource. Unlike conventional secrecy techniques that prevent an eavesdropper from recovering transmitted bits, the proposed paradigm allows packet decoding but prevents correct interpretation by making original and dummy packets computationally indistinguishable. Rather than protecting individual transmissions, successive transmissions are intentionally coupled so that future communication depends on correctly interpreting previous ones. As one realization, we develop a state-chained random linear network coding (RLNC) framework in which the synchronization state required to interpret each transmission block is embedded in the previous block. Therefore, synchronization failures propagate across future transmissions, resulting in persistent eavesdropper asynchronization. We analytically characterize the probability and persistence of eavesdropper asynchronization, together with the computational complexity of resynchronization, and develop transmission strategies based on transmit power and intentional-interference optimization. Numerical results demonstrate sub-second eavesdropper asynchronization under a worst- case adversarial model with no channel advantage, no secret assumptions, complete protocol knowledge, and an arbitrarily stronger eavesdropper.
