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 International Symposium on Information Theory (ISIT)

Secrecy capacity region of the Gaussian multi-receiver wiretap channel

Ersen Ekrem, Şennur Ulukuş

Published Jun 1, 2009• 21 citations
Publisher

Abstract

We consider the Gaussian multi-receiver wiretap channel and evaluate its secrecy capacity region. This evaluation requires the identification of underlying auxiliary random variables. For this purpose, we first visit the converse proof of the scalar Gaussian broadcast channel, and show that this proof cannot be extended to this secrecy context. The failure of this extension comes from the insufficiency of the entropy-power inequality to resolve the ambiguity regarding the auxiliary random variables. Instead, we provide two converse proofs. The first one uses the alternative representation of the mutual information as an integration of the minimum-mean-square-error (MMSE) along with the properties of the MMSE. The second one uses the relationship between the differential entropy and the Fisher information via the de Bruin identity along with the properties of the Fisher information.

DOI
10.1109/isit.2009.5205959

Related papers

An alternative proof for the secrecy capacity region of the Gaussian wiretap channel

Fangbiao Li, Xiao Chen, Zhi Xue +2 more

This paper considers the problem of proof for the secrecy capacity region of the Gaussian wiretap channel. In this channel, the transmitter sends confidential messages to the legitimate receivers, which need to be kept asymptotically perfectly secret from the eavesdropper. We characterize the secrecy capacity region of this channel and give a converse proof by using the fundamental relationship between information theory and the estimation theory in the Gaussian channel, relating the derivative of the mutual information to the minimum mean-square-error (MMSE). Our proof is different from the superposition coding and the random binning. We obtain that using the relationship between MMSE and mutual information one can provide insightful and simple proofs for multiuser single antenna problems and the secrecy capacity problem, such as broadcast channel.

Symposium on ICT and Energy Efficiency and Workshop on Information Theory and Security (CIICT)•Jan 1, 2012•0 citations

The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel

Ersen Ekrem, Şennur Ulukuş

In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques for the Gaussian scalar broadcast channel cannot be extended to this secrecy context, to emphasize the need for a new proof technique. Our new proof technique makes use of the relationships between the minimum-mean-square-error and the mutual information, and equivalently, the relationships between the Fisher information and the differential entropy. Using the intuition gained from the converse proof of the SISO channel, we first prove the secrecy capacity region of the degraded MIMO channel, in which all receivers have the same number of antennas, and the noise covariance matrices can be arranged according to a positive semi-definite order. We then generalize this result to the aligned case, in which all receivers have the same number of antennas; however, there is no order among the noise covariance matrices. We accomplish this task by using the channel enhancement technique. Finally, we find the secrecy capacity region of the general MIMO channel by using some limiting arguments on the secrecy capacity region of the aligned MIMO channel. We show that the capacity achieving coding scheme is a variant of dirty-paper coding with Gaussian signals.

arXiv:0903.3096•IEEE Transactions on Information Theory•Mar 15, 2011•240 citations

An MMSE Approach to the Secrecy Capacity of the MIMO Gaussian Wiretap Channel

Ronit Bustin, Ruoheng Liu, H. Vincent Poor +1 more

This paper provides a closed-form expression for the secrecy capacity of the multiple-input multiple output (MIMO) Gaussian wiretap channel, under a power-covariance constraint. Furthermore, the paper specifies the input covariance matrix required in order to attain the capacity. The proof uses the fundamental relationship between information theory and estimation theory in the Gaussian channel, relating the derivative of the mutual information to the minimum mean-square error (MMSE). The proof provides the missing intuition regarding the existence and construction of an enhanced degraded channel that does not increase the secrecy capacity. The concept of enhancement has been used in a previous proof of the problem. Furthermore, the proof presents methods that can be used in proving other MIMO problems, using this fundamental relationship.

EURASIP Journal on Wireless Communications and Networking•Jul 27, 2009•151 citations

The individual secrecy capacity of degraded multi-receiver wiretap broadcast channels

Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche

We study secure communication over a degraded wiretap broadcast channel with multiple receivers and an eavesdropper. We consider two different secrecy measures: the traditional joint secrecy where the mutual information leakage of all messages must be small; and individual secrecy where the sum of the information leakage of each individual message must be small. At first, we investigate the joint secrecy criterion, where we present the capacity region established before and provide a simpler converse proof. We then consider the individual secrecy criterion and establish its capacity region, by combining the techniques of wiretap random coding and Shannon's one time pad principle. Our results indicate that the individual secrecy capacity region is bigger than the joint one. Further, we show that the established capacity regions are valid for any degraded wiretap broadcast channel, regardless of the degradedness order of the eavesdropper. Finally, we extend our results to Gaussian channels.

International Conference on Communications•Jun 1, 2015•16 citations

An MMSE approach to the secrecy capacity of the MIMO Gaussian wiretap channel

Ronit Bustin, Ruoheng Liu, H. Vincent Poor +1 more

This paper provides a closed-form expression for the secrecy capacity of the multiple-input multiple-output (MIMO) Gaussian wiretap channel, under a power-covariance constraint. Furthermore, the paper specifies the input covariance matrix required in order to attain the capacity. The proof uses the fundamental relationship between information theory and estimation theory in the Gaussian channel, relating the derivative of the mutual information to the minimum mean-square error (MMSE). The proof provides the missing intuition regarding the existence and construction of an enhanced degraded channel that does not increase the secrecy capacity. The concept of enhancement has been used in a previous proof of the problem. Furthermore, the proof presents methods that can be used in proving other MIMO problems, using this fundamental relationship.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•88 citations

On the Individual Secrecy Capacity Regions of the General, Degraded, and Gaussian Multi-Receiver Wiretap Broadcast Channel

Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche

In this paper, secure communication over a broadcast channel with multiple legitimate receivers and an external eavesdropper is investigated. Two different secrecy measures are considered. The first criterion is a conservative one known as joint secrecy, where the mutual leakage of all confidential messages must be small. The second criterion is a less conservative constraint known as individual secrecy, where the individual leakage of each confidential message must be small. At first, we consider the degraded multi-receiver wiretap broadcast channel and manage to establish the individual secrecy capacity region. Our encoding scheme applies a careful combination of the standard techniques of wiretap random coding and Shannon's one time pad encoding, where the confidential messages of the weak receivers are used as secret keys for the stronger ones. The validity of this technique is due to the properties of the degraded broadcast channel and the secrecy requirements of the individual secrecy criterion. Our result indicates that the individual secrecy capacity region is in fact larger than the joint one established in earlier literature. The established capacity region is then used to derive the individual secrecy capacity regions of the Gaussian single-input single-output and degraded Gaussian multiple-input multiple-output multi-receiver wiretap broadcast channels. Furthermore, we present an achievable rate region for the general two-receiver wiretap broadcast channel under both the joint and the individual secrecy criterion. Comparing these two rate regions suggests that even for the general case, the individual secrecy criterion might be able to provide a larger rate region compared with the joint one.

IEEE Transactions on Information Forensics and Security•May 10, 2016•15 citations
We consider the Gaussian multi-receiver wiretap channel and evaluate its secrecy capacity region. This evaluation requires the identification of underlying auxiliary random variables. For this purpose, we first visit the converse proof of the scalar Gaussian broadcast channel, and show that this proof cannot be extended to this secrecy context. The failure of this extension comes from the insufficiency of the entropy-power inequality to resolve the ambiguity regarding the auxiliary random variables. Instead, we provide two converse proofs. The first one uses the alternative representation of the mutual information as an integration of the minimum-mean-square-error (MMSE) along with the properties of the MMSE. The second one uses the relationship between the differential entropy and the Fisher information via the de Bruin identity along with the properties of the Fisher information.
This paper considers the problem of proof for the secrecy capacity region of the Gaussian wiretap channel. In this channel, the transmitter sends confidential messages to the legitimate receivers, which need to be kept asymptotically perfectly secret from the eavesdropper. We characterize the secrecy capacity region of this channel and give a converse proof by using the fundamental relationship between information theory and the estimation theory in the Gaussian channel, relating the derivative of the mutual information to the minimum mean-square-error (MMSE). Our proof is different from the superposition coding and the random binning. We obtain that using the relationship between MMSE and mutual information one can provide insightful and simple proofs for multiuser single antenna problems and the secrecy capacity problem, such as broadcast channel.
In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques for the Gaussian scalar broadcast channel cannot be extended to this secrecy context, to emphasize the need for a new proof technique. Our new proof technique makes use of the relationships between the minimum-mean-square-error and the mutual information, and equivalently, the relationships between the Fisher information and the differential entropy. Using the intuition gained from the converse proof of the SISO channel, we first prove the secrecy capacity region of the degraded MIMO channel, in which all receivers have the same number of antennas, and the noise covariance matrices can be arranged according to a positive semi-definite order. We then generalize this result to the aligned case, in which all receivers have the same number of antennas; however, there is no order among the noise covariance matrices. We accomplish this task by using the channel enhancement technique. Finally, we find the secrecy capacity region of the general MIMO channel by using some limiting arguments on the secrecy capacity region of the aligned MIMO channel. We show that the capacity achieving coding scheme is a variant of dirty-paper coding with Gaussian signals.
This paper provides a closed-form expression for the secrecy capacity of the multiple-input multiple output (MIMO) Gaussian wiretap channel, under a power-covariance constraint. Furthermore, the paper specifies the input covariance matrix required in order to attain the capacity. The proof uses the fundamental relationship between information theory and estimation theory in the Gaussian channel, relating the derivative of the mutual information to the minimum mean-square error (MMSE). The proof provides the missing intuition regarding the existence and construction of an enhanced degraded channel that does not increase the secrecy capacity. The concept of enhancement has been used in a previous proof of the problem. Furthermore, the proof presents methods that can be used in proving other MIMO problems, using this fundamental relationship.
We study secure communication over a degraded wiretap broadcast channel with multiple receivers and an eavesdropper. We consider two different secrecy measures: the traditional joint secrecy where the mutual information leakage of all messages must be small; and individual secrecy where the sum of the information leakage of each individual message must be small. At first, we investigate the joint secrecy criterion, where we present the capacity region established before and provide a simpler converse proof. We then consider the individual secrecy criterion and establish its capacity region, by combining the techniques of wiretap random coding and Shannon's one time pad principle. Our results indicate that the individual secrecy capacity region is bigger than the joint one. Further, we show that the established capacity regions are valid for any degraded wiretap broadcast channel, regardless of the degradedness order of the eavesdropper. Finally, we extend our results to Gaussian channels.
This paper provides a closed-form expression for the secrecy capacity of the multiple-input multiple-output (MIMO) Gaussian wiretap channel, under a power-covariance constraint. Furthermore, the paper specifies the input covariance matrix required in order to attain the capacity. The proof uses the fundamental relationship between information theory and estimation theory in the Gaussian channel, relating the derivative of the mutual information to the minimum mean-square error (MMSE). The proof provides the missing intuition regarding the existence and construction of an enhanced degraded channel that does not increase the secrecy capacity. The concept of enhancement has been used in a previous proof of the problem. Furthermore, the proof presents methods that can be used in proving other MIMO problems, using this fundamental relationship.
In this paper, secure communication over a broadcast channel with multiple legitimate receivers and an external eavesdropper is investigated. Two different secrecy measures are considered. The first criterion is a conservative one known as joint secrecy, where the mutual leakage of all confidential messages must be small. The second criterion is a less conservative constraint known as individual secrecy, where the individual leakage of each confidential message must be small. At first, we consider the degraded multi-receiver wiretap broadcast channel and manage to establish the individual secrecy capacity region. Our encoding scheme applies a careful combination of the standard techniques of wiretap random coding and Shannon's one time pad encoding, where the confidential messages of the weak receivers are used as secret keys for the stronger ones. The validity of this technique is due to the properties of the degraded broadcast channel and the secrecy requirements of the individual secrecy criterion. Our result indicates that the individual secrecy capacity region is in fact larger than the joint one established in earlier literature. The established capacity region is then used to derive the individual secrecy capacity regions of the Gaussian single-input single-output and degraded Gaussian multiple-input multiple-output multi-receiver wiretap broadcast channels. Furthermore, we present an achievable rate region for the general two-receiver wiretap broadcast channel under both the joint and the individual secrecy criterion. Comparing these two rate regions suggests that even for the general case, the individual secrecy criterion might be able to provide a larger rate region compared with the joint one.