Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Conference on Communications and Network Security

On secure communication over multiple access wiretap channels under channel uncertainty

Rafael F. Schaefer, H. Vincent Poor

Published Oct 1, 2014• 4 citations
Publisher

Abstract

The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.

DOI
10.1109/cns.2014.6997474

Related papers

Multiple Access Channel with Common Message and Secrecy constraint

Hassan ZivariFard, Bahareh Akhbari, Mahmoud Ahmadian‐Attari +1 more

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 with Common message (MAWC-CM). For this setting, we 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, we derive inner and outer bounds on the secrecy capacity region. Providing numerical results for the Gaussian case, we 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.

arXiv:1402.4799•Feb 19, 2014•0 citations

Multiple access channel with common message and secrecy constraint

Hassan ZivariFard, Bahareh Akhbari, Mahmoud Ahmadian‐Attari +1 more

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.

IET Communications•Dec 17, 2015•6 citations

Robust transmission over wiretap channels with secret keys

Rafael F. Schaefer, H. Vincent Poor

The wiretap channel with secret keys models the problem of secure communication in the presence of a non-legitimate eavesdropper, where the transmitter and legitimate receiver share a secret key of finite rate. This communication scenario is studied for compound channels. An achievable strong secrecy rate is presented and a multi-letter upper bound is derived. For degraded compound wiretap channels with secret keys the strong secrecy capacity is established. Finally, the case of channel state information at the transmitter is discussed and the secrecy capacity is established for this case as well.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2014•3 citations

Multiple Access Wire-tap Channel with Common Message.

Hassan ZivariFard, Bahareh Akhbari, Mahmoud Ahmadian‐Attari +1 more

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.

•Feb 19, 2014•0 citations

On the Secrecy Capacity Region of Multiple Access Wire-tap Channel with Common Message

Hassan ZivariFard, Bahareh Akhbari, Mahmoud Ahmadian‐Attari +1 more

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.

arXiv:1402.4799?context=math•Feb 19, 2014•0 citations

Robust Broadcasting of Common and Confidential Messages Over Compound Channels: Strong Secrecy and Decoding Performance

Rafael F. Schaefer, Holger Boche

The broadcast channel with confidential messages (BCC) consists of one transmitter and two receivers, where the transmitter sends a common message to both receivers and, at the same time, a confidential message to one receiver which has to be kept secret from the other one. In this paper, this communication scenario is studied for compound channels, where it is only known to the transmitter and receivers that the actual channel realization is fixed and from a prespecified set of channels. The information theoretic criterion of strong secrecy is analyzed in detail and its impact on the decoding performance of the non-legitimate receiver is characterized. In particular, it is shown that regardless of the computational capabilities and the applied decoding strategy of the non-legitimate receiver, his decoding error always tends to one. This gives a valuable signal processing implication of the strong secrecy criterion and identifies desirable properties of an optimal code design. Further, an achievable strong secrecy rate region is derived and a multiletter outer bound is given. Both together yield a multiletter expression of the strong secrecy capacity region of the compound BCC.

IEEE Transactions on Information Forensics and Security•Aug 14, 2014•22 citations
The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.
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 with Common message (MAWC-CM). For this setting, we 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, we derive inner and outer bounds on the secrecy capacity region. Providing numerical results for the Gaussian case, we 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.
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.
The wiretap channel with secret keys models the problem of secure communication in the presence of a non-legitimate eavesdropper, where the transmitter and legitimate receiver share a secret key of finite rate. This communication scenario is studied for compound channels. An achievable strong secrecy rate is presented and a multi-letter upper bound is derived. For degraded compound wiretap channels with secret keys the strong secrecy capacity is established. Finally, the case of channel state information at the transmitter is discussed and the secrecy capacity is established for this case as well.
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.
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.
The broadcast channel with confidential messages (BCC) consists of one transmitter and two receivers, where the transmitter sends a common message to both receivers and, at the same time, a confidential message to one receiver which has to be kept secret from the other one. In this paper, this communication scenario is studied for compound channels, where it is only known to the transmitter and receivers that the actual channel realization is fixed and from a prespecified set of channels. The information theoretic criterion of strong secrecy is analyzed in detail and its impact on the decoding performance of the non-legitimate receiver is characterized. In particular, it is shown that regardless of the computational capabilities and the applied decoding strategy of the non-legitimate receiver, his decoding error always tends to one. This gives a valuable signal processing implication of the strong secrecy criterion and identifies desirable properties of an optimal code design. Further, an achievable strong secrecy rate region is derived and a multiletter outer bound is given. Both together yield a multiletter expression of the strong secrecy capacity region of the compound BCC.