Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2022-07, Vol.68 (7), p.4700-4722
Main Authors: Chen, Yiqi, He, Dan, Ying, Chenhao, Luo, Yuan
Format: Article
Language:English
Subjects:
Arbitrarily varying wiretap channel
Coders
Codes
Electronic surveillance
Encoding
Jamming
Lower bounds
Noise measurement
Numerical models
state constraint
Stochastic processes
stochastic-encoder code
strong secrecy
Upper bound
Upper bounds
Wiretapping
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2022.3161808