Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints
Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints
复制标题
带约束的任意变化窃听通道的强保密性
DOI：
10.1109/tit.2022.3161808
复制
发表时间：
2022-07
影响因子：
2.5
通讯作者：
Yuan Luo
中科院分区：
文献类型：
--
作者：
Yiqi Chen;Dan He;Chenhao Ying;Yuan Luo
研究了具有输入约束和状态约束的任意变窃听信道的强保密传输问题。首先，利用类型参数和Csiszár的几乎独立的着色引理，建立了强保密能力的随机编码器码下界。然后给出了保密容量的一个叠加随机编码器码下界。叠加随机编码器码的下界可以大于普通随机编码器码的下界。进一步给出了带约束的AVWC保密容量的随机码下界和上界。在此基础上，我们进一步考虑了模型的一种特殊情况，即严重低噪声AVWC，并给出了随机编码器编码和随机码容量。证明了带约束的AVWC的随机编码器码容量等于或严格小于相应的随机码容量，这与普通AVC的性质一致。最后，给出了一些数值例子来更好地说明我们的容量结果。与软覆盖引理要求码字id生成相比，我们的方法对码本有更宽松的要求。证明了从给定类型集中随机选择码字可以生成安全传输的良好码本，这在考虑带约束的AVWC时是至关重要的。
The strong secrecy transmission problem of the arbitrarily varying wiretap channel (AVWC) with input and state constraints is investigated in this paper. First, a stochastic-encoder code lower bound of the strong secrecy capacity is established by applying the type argument and Csiszár’s almost independent coloring lemma. Then, a superposition stochastic-encoder code lower bound of the secrecy capacity is provided. The superposition stochastic-encoder code lower bound can be larger than the ordinary stochastic-encoder code lower bound. Random code lower and upper bounds of the secrecy capacity of the AVWC with constraints are further provided. Based on these results, we further consider a special case of the model, namely severely less noisy AVWC, and give the stochastic-encoder code and random code capacities. It is proved that the stochastic-encoder code capacity of the AVWC with constraints is either equal to or strictly smaller than the corresponding random code capacity, which is consistent with the property of the ordinary AVC. Finally, some numerical examples are presented to better illustrate our capacity results. Compared to the soft covering lemma that requires the codewords to be generated i.i.d., our method has more relaxed requirements regarding codebooks. It is proved that the good codebooks for secure transmission can be generated by choosing codewords randomly from a given type set, which is critical when considering the AVWC with constraints.