SearcharxivSearch

arXiv subjects

Linman Yu

Publications and source records attributed to Linman Yu.

2 recordsLinked to original sources

Feedback Coding Schemes for the Broadcast Channel with Mutual Secrecy Requirement

Recently, the physical layer security (PLS) of the communication systems has been shown to be enhanced by using legal receiver's feedback. The present secret key based feedback scheme mainly focuses on producing key from the feedback and using this key to protect part of the transmitted message. However, this feedback scheme has been proved only optimal for several degraded cases. The broadcast channel with mutual secrecy requirement (BC-MSR) is important as it constitutes the essence of physical layer security (PLS) in the down-link of the wireless communication systems. In this paper, we investigate the feedback effects on the BC-MSR, and propose two inner bounds and one outer bound on the secrecy capacity region of the BC-MSR with noiseless feedback. One inner bound is constructed according to the already existing secret key based feedback coding scheme for the wiretap channel, and the other is constructed by a hybrid coding scheme using feedback to generate not only keys protecting the transmitted messages but also cooperative messages helping the receivers to improve their decoding performance. The performance of the proposed feedback schemes and the gap between the inner and outer bounds are further explained via two examples.

cs.IT

Relay Broadcast Channel with Confidential Messages

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the capacity-equivocation region are provided. Second, we investigate the discrete memoryless relay broadcast channels with two confidential messages. Inner and outer bounds on the capacity-equivocation region are provided. Finally, we investigate the discrete memoryless relay broadcast channels with one confidential message and one common message. Inner and outer bounds on the capacity-equivocation region are provided, and the results are further explained via a Gaussian example. Compared with Csiszar-Korner's work on broadcast channels with confidential messages (BCC), we find that with the help of the relay node, the secrecy capacity region of the Gaussian BCC is enhanced.

cs.IT