We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models. We present explicit wiretap codes that can handle these models in a unified manner and only rely on three primitives, namely source coding with side information, universal hashing, and distribution approximation. Our explicit wiretap codes achieve the best known single-letter achievable rates, previously obtained non-constructively, for the models considered. Our results are obtained for strong secrecy, do not require a pre-shared secret between the legitimate users, and do not require any symmetry properties on the channel. An extension of our results to compound main channels is also derived via new capacity-achieving polar coding schemes for compound settings.
翻译:我们认为窃听器频道的窃听频道具有不确定性的窃听器是:(一) 吵闹的二类、(二)化合物或(三) 任意不同的模式。我们提出了明确的窃听码,可以统一处理这些模式,只依靠三种原始数据,即附带信息的源代码、普遍散列和分布近似。我们明确的窃听码为所考虑的模式实现了最已知的单字母可实现率,以前是非建设性获得的。我们的结果是建立在高度保密的基础上,不需要合法用户之间事先共享秘密,也不需要在频道上建立任何对称性特性。我们的结果扩大到复合主要渠道,也是通过新的实现复合环境的极地编码计划获得的。