In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel ...

This paper studies the Gaussian wiretap channel with correlated sources available not only at the transmitter and legitimate receiver, but also the eavesdropper. In particular, we are interested in the open problem of finding the optimal auxiliary random variable, which provides a closed-form solution to the secret-message and secret-key capacity region. To do that, we first take a deterministi...

We investigate the ergodic secrecy capacity of a Multiple-Input Multiple-Output (MIMO) wire-tap channel, where the instantaneous Channel State Information (CSI) is available at both the legitimate receiver and the eavesdropper, but not at the source. We derive the perfectsecrecy capacity under a general ergodic fading process (with a continuous probability density function) and show that a circ...

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity CS , which is usually smaller than the channel capacity C. In order to remove the loss C−CS , we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multipl...

This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on polarization of different binary symmetric channels over different fading blocks, each cha...