Arbitrarily Varying Wiretap Channels with Type Constrained States
Arbitrarily Varying Wiretap Channels with Type Constrained States
复制标题
具有类型约束状态的任意变化的窃听通道
DOI：
10.1109/glocomw.2016.7848839
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
H. Permuter
中科院分区：
文献类型：
--
作者：
Ziv Goldfeld;P. Cuff;H. Permuter
任意变化的窃听信道（AVWTC）是一个开放的问题，主要是因为两个主要的挑战。它不仅捕获的困难的复合窃听信道（另一个开放的问题）作为一个特殊的情况下，它还要求保密性是确保相对于指数许多可能的信道状态序列。这项工作克服了上述第二个困难。为此，我们考虑了一个AVWTC的类型约束的允许状态序列，并推导出一个单字母的相关随机（CR）辅助语义安全（SS）的能力。允许的状态序列是围绕单个约束类型的典型集合中的状态序列。SS的建立表明，消息和窃听者的意见之间的相互信息是可以忽略不计的，即使在所有的消息分布，状态序列的选择和实现的CR码最大化。类型约束编码定理的可证明性和匡威证明都依赖于比实际要求更强的声明。直接部分建立了一个新的单字母下界的CR辅助SS容量的AVWTC与状态序列约束的任何凸和封闭的状态概率质量函数。这个界限实现了最好的已知的单字母保密率为相应的复合窃听信道在相同的约束集。在AVWTC文献中的其他单字母的结果相比，推导不假设存在一个最佳的通道窃听。最优性是一个结果的最大-inf上界的CR辅助SS容量的AVWTC与状态序列约束到任何集合的类型类。当调整到上述复合WTC时，上限简化为最大-最小结构，从而加强了Liang等人先前最著名的具有最小-最大形式的单字母上限。
The arbitrarily varying wiretap channel (AVWTC) is an open problem largely because of two main challenges. Not only does it capture the difficulty of the compound wiretap channel (another open problem) as a special case, it also requires that secrecy is ensured with respect to exponentially many possible channel state sequences. This work overcomes the second aforementioned difficulty. To that end, we consider an AVWTC with a type constraint on the allowed state sequences, and derive a single- letter characterization of its correlated-random (CR) assisted semantic-security (SS) capacity. The allowed state sequences are the ones in a typical set around a single constraining type. SS is established by showing that the mutual information between the message and the eavesdropper's observations is negligible even when maximized over all message distributions, choices of state sequences and realizations of the CR-code. Both the achievability and the converse proofs of the type constrained coding theorem rely on stronger claims than actually required. The direct part establishes a novel single-letter lower bound on the CR-assisted SS-capacity of an AVWTC with state sequences constrained by any convex and closed set of state probability mass functions. This bound achieves the best known single-letter secrecy rates for a corresponding compound wiretap channel over the same constraint set. In contrast to other single-letter results in the AVWTC literature, the derivation does not assume the existence of a best channel to the eavesdropper. Optimality is a consequence of a max-inf upper bound on the CR-assisted SS-capacity of an AVWTC with state sequences constrained to any collection of type-classes. When adjusted to the aforementioned compound WTC, the upper bound simplifies to a max-min structure, thus strengthening the previously best known single- letter upper bound by Liang et al. that has a min- max form.
DOI：
10.1109/tifs.2015.2465937
发表时间：
2015-12-01
影响因子：
6.8
作者：
Boche, Holger;Schaefer, Rafael F.;Poor, H. Vincent
通讯作者：
Poor, H. Vincent