Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are calculated via extensions of a technique due to Chia and El Gamal and the method of output statistics of random binning. Outer bounds are derived for both the degraded and non-degraded versions of the channel, and examples are provided in which the inner and outer bounds meet. The inner bounds recover known results for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel. An auxiliary result is also produced that derives an inner bound on the minimal randomness necessary to achieve secrecy in multiple-access wiretap channels.
Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are calculated via extensions of a technique due to Chia and El Gamal and the method of output statistics of random binning. Outer bounds are derived for both the degraded and non-degraded versions of the channel, and examples are provided in which the inner and outer bounds meet. The inner bounds recover known results for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel. An auxiliary result is also produced that derives an inner bound on the minimal randomness necessary to achieve secrecy in multiple-access wiretap channels.
We study the two-transmitter two-receiver channel with confidential messages channel under a secrecy constraint, exploring the effect of a single eavesdropper on the secure communication rate. A general achievable secrecy rate region and an outer bound are derived for the degraded version of this channel. An example is provided in which the inner and outer bound meet. For the general non-degraded channel, another outer bound is derived and a special case is highlighted in which the inner and outer bound meet. Our inner bound recovers the known inner bounds for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel.
We study the multi-receiver wiretap channel (MR-WC) with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter sends a pair of public and confidential messages to each legitimate user. While there are no secrecy constraints on the public messages, confidential messages need to be transmitted in perfect secrecy. We study the discrete memoryless MR-WC as well as its Gaussian multi-input multi-output (MIMO) counterpart. First, we propose an inner bound for the general, not necessarily degraded, discrete memoryless MR-WC by using Marton's inner bound and rate splitting in conjunction with superposition coding and binning. Second, we specialize this inner bound for the degraded discrete memoryless case. This specialized form of the inner bound can be obtained by using superposition coding and binning only. Next, we obtain an outer bound for the capacity region of the degraded channel, which matches the inner bound for some special cases. Third, we consider the degraded Gaussian MIMO channel, and show that, to evaluate both the inner and outer bounds, considering only jointly Gaussian auxiliary random variables and channel input is sufficient. Similar to the discrete memoryless case, for the Gaussian MIMO case as well, these bounds match for some special cases.
In this paper, we study the problem of secret communication over a Multiple Access Wire-tap Channel with Common Message. In this channel, we assume that two transmitters have confidential messages which must be kept secret from the eavesdropper (receiver 2), and both of them have a common message which can be decoded by two receivers. For this setting, in the discrete memoryless case we derive general inner and outer bounds on the secrecy capacity region. Also, we derive inner and outer bounds on the secrecy capacity region for the Gaussian case. Providing numerical examples for the Gaussian case, we illustrate the comparison between derived achievable rate regions, outer bounds and the capacity region of compound multiple access channel.
Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user obtains a degraded version of the output of the MAC. Each user views the other user as a eavesdropper, and wishes to keep its confidential message as secret as possible from the other user. Measuring each user's uncertainty about the other user's confidential message by equivocation, the inner and outer bounds on the capacity-equivocation region for this model have been provided. The result is further explained via the binary and Gaussian examples. Second, the discrete memoryless multiple-access wiretap channel (MAC-WT) is studied, where two users transmit their corresponding confidential messages (no common message) to a legitimate receiver, while an additional wiretapper wishes to obtain the messages via a wiretap channel. This new model is considered into two cases: the general MAC-WT with cooperative encoders, and the degraded MAC-WT with non-cooperative encoders. The capacity-equivocation region is totally determined for the cooperative case, and inner and outer bounds on the capacity-equivocation region are provided for the non-cooperative case. For both cases, the results are further explained via the binary examples.
The authors study the problem of secret communication over a multiple‐access channel with a common message. Here, the authors 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. The authors call this setting as multiple‐access wiretap channel with common message (MAWC‐CM). For this setting, the authors derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a special case called the switch channel. As well, for a Gaussian version of MAWC‐CM, the authors derive inner and outer bounds on the secrecy capacity region. Providing numerical results for the Gaussian case, the authors illustrate the comparison between the derived achievable rate region and the outer bound for the considered model and the capacity region of compound multiple access channel.
In this paper, we study the problem of secret communication over a Multiple Access Wire-tap Channel with Common Message. Here, we assume that two transmitters have confidential messages which must be kept secret from the eavesdropper (the second receiver), and both of them have access to a common message which can be decoded by two receivers. For this setting, we derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case as well as for Gaussian one. Providing numerical examples for the Gaussian case, we illustrate the comparison between derived achievable rate regions and outer bounds for our considered model and the capacity region of compound multiple access channel.