An achievable secrecy capacity region for multiple-access wiretap channel with common message and side information

In this paper, we study the discrete memory Multiple Access Wiretap Channel (DM-MAWC) with one common message and non-causal side information. In this channel, two transmitters send a common message to the receivers, meanwhile they both transmit an individual confidential message, which must be kept secret from the second receiver (viewed as a wiretapper) to the first receiver. As the side information is non-causally available at the transmitters, we derive the achievable perfect secrecy capacity region for the MAWC with one common message and non-casual side information available at the transmitters by using Cover´s superposition coding and Gelfand-Pinsker random binning coding schemes. The achievable secrecy capacity region of this paper subsumes the region of multiple access wiretap channel with or without common message and without side information as its special cases.