Wiretap Channels With One-Time State Information: Strong Secrecy

Abstract

The coding problem for wiretap channels with causal state information available at the encoder is studied. In particular, we address the wiretap channel only with one-time state information (instead of the usual causal state information up to present) in the sense that the one-time encoder uses only the current state information $S_{k}$ at each time $k$ to establish the secrecy capacity formula under the $\delta $ -strong secrecy criterion. The coding problem for wiretap channels with one-time channel state information available at the encoder under cost constraints is also studied and lower bounds on the “ $\delta $ -strong” secrecy capacity given cost are also demonstrated.