Wiretap Channels With Causal and Non-Causal State Information: Revisited
From MaRDI portal
Publication:4958288
Abstract: The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here particularily with the problem of achievable secret-message secret-key rate pairs under the semantic security criterion. Our main result extends all the previous results on achievable rates as given by Chia and El Gamal [10], Fujita [11], and Han and Sasaki [23]. In order to do this, we first derive a unifying theorem (Theorem 2) with causal CSI at Alice, which follows immediately by leveraging the unifying seminal theorem for wiretap channels with non-causal CSI at Alice as recently established by Bunin et al. [22]. The only thing to do here is just to re-interpret the latter non-causal one in a causal manner. A prominent feature of this approach is that we are able to dispense with the block-Markov encoding scheme as used in the previous works. Also, the exact secret-message key capacity region for wiretap channels with non-causal CSI at both Alice and Bob is given.
Recommendations
- Wiretap Channel With Causal State Information
- Wiretap Channels With Causal State Information: Strong Secrecy
- Wiretap Channels With Random States Non-Causally Available at the Encoder
- Wiretap channel in the presence of action-dependent states and noiseless feedback
- Impact of Action-Dependent State and Channel Feedback on Gaussian Wiretap Channels
- Wiretap Channels: Nonasymptotic Fundamental Limits
- The Multiple-Access Channel With Causal Side Information: Common State
- Wiretap channel with action-dependent channel state information
- The Multiple-Access Channel With Causal Side Information: Double State
Cited in
(2)
This page was built for publication: Wiretap Channels With Causal and Non-Causal State Information: Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958288)