Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
复制标题
DOI：
10.1007/11889342_13
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
R. Ahlswede;N. Cai
中科院分区：
文献类型：
--
作者：
R. Ahlswede;N. Cai
我们分析有线磁带渠道与安全的反馈，从合法的接收器。我们提出了一个下限的传输容量（定理1），我们猜想它是紧的，并且证明它是紧的（推论1）对于Wyner的原始（降级）有线磁带信道，并且还用于合法接收器从敌人获得降级版本的非降级有线磁带信道（推论2）.令人惊讶的是，我们完全确定了安全公共随机性（定理2）和安全识别（定理3和推论3）的能力。与DMC不同，这些量在这里是不同的，因为识别与非安全的公共随机性有关。
We analyze wire-tape channels with secure feedback from the legitimate receiver. We present a lower bound on the transmission capacity (Theorem 1), which we conjecture to be tight and which is proved to be tight (Corollary 1) for Wyner’s original (degraded) wire-tape channel and also for the reversely degraded wire-tape channel for which the legitimate receiver gets a degraded version from the enemy (Corollary 2).Somewhat surprisingly we completely determine the capacities of secure common randomness (Theorem 2) and secure identification (Theorem 3 and Corollary 3). Unlike for the DMC, these quantities are different here, because identification is linked to non-secure common randomness.