Capacity Limits of Pseudorandom Channels in Deception Problems
Capacity Limits of Pseudorandom Channels in Deception Problems
复制标题
DOI：
10.1109/tifs.2015.2423656
复制
发表时间：
2015-04
影响因子：
6.8
通讯作者：
Enping Li;S. Craver;Jun Yu
中科院分区：
文献类型：
--
作者：
Enping Li;S. Craver;Jun Yu
超阈值通道于 1998 年引入，作为在活跃管理员在场的情况下实现公钥交换的一种手段。这些通道的内容对所有委托人都是可见的（它们的内容不受密钥隐藏或保护），但对于活跃的典狱长来说非常稳健。假设这种高鲁棒性允许传输密钥交换数据报。在本文中，我们提供了一个超阈值通道的理论模型，作为随机数据通道，并对其分布进行约束。我们提出了一个令人惊讶的结果，在这样的模型中，极小的篡改可能会无限期地破坏密钥交换。与传统的通信理论不同，隐写信道的特定约束阻止了使用冗余来实现更可靠的传输，甚至可能使通信对于主动对手来说更加脆弱。然而，这个结果需要一个警惕的对手，我们提出了一个协议，以增加在典狱长篡改暂停的情况下成功密钥交换的概率。
Supraliminal channels were introduced in 1998 as a means to achieve public key exchange in the presence of an active warden. These channels have content visible to all principals-their content is not concealed or protected by a secret key-but are highly robust to an active warden. It is assumed that this high robustness allows the transmission of key exchange datagrams. In this paper, we provide a theoretical model for supraliminal channels as channels of random data with a constraint on their distribution. We present a surprising result that in such a model, vanishingly small tampering can indefinitely derail key exchange. Unlike traditional communication theory, the specific constraints of steganographic channels prevent the use of redundancy to achieve more reliable transmission, and can even make communication more fragile to an active adversary. This result requires a vigilant adversary, however, and we propose a protocol to increase the probability of successful key exchange in the event of a pause in the warden's tampering.