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

Symposium on ICT and Energy Efficiency and Workshop on Information Theory and Security (CIICT)

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

Fangbiao Li, Xiao Chen, Zhi Xue, Jie Gu, Yan Zhu

Published Jan 1, 2012• 0 citations
Publisher

Abstract

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.

DOI
10.1049/cp.2012.1865

Related papers

Secrecy capacity region of the Gaussian multi-receiver wiretap channel

Ersen Ekrem, Şennur Ulukuş

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.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•24 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•243 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•152 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•87 citations

Secrecy capacity region of Gaussian broadcast channel

Ghadamali Bagherikaram, Seyed Abolfazl Motahari, Amir Keyvan Khandani

In this paper, we first consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-taper also receives the transmitted signal. We assume that the signals are transmitted over additive white Gaussian noise channels. We characterize the secrecy capacity region of this channel. Our achievable coding scheme is based on superposition coding and the random binning. We refer to this scheme as secret superposition coding. The converse proof combines the converse proof for the conventional Gaussian broadcast channel and the perfect secrecy constraint. This capacity region matches the capacity region of the broadcast channel without security constraint. It also matches the secrecy capacity of the wire-tap channel. Based on the rate characterization of the secure Gaussian broadcast channel, we then use a multilevel coding approach for the slowly fading wire-tap. We assume that the transmitter only knows the eavesdropper's channel. In this approach, source node sends secure layered coding and the receiver viewed as a continuum ordered users. We derive optimum power allocation for the layers which maximizes the total average rate.

Conference on Information Sciences and Systems•Mar 1, 2009•29 citations

Transmission of common, public and confidential messages in broadcast channels with multiple antennas

Ersen Ekrem, Şennur Ulukuş

We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. Moreover, the legitimate user receives a private message, which is desired to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region of the Gaussian MIMO wiretap channel. This region contains all achievable common message, private message, and private message's equivocation rates. This capacity-equivocation region is equal to the capacity region of a Gaussian MIMO broadcast channel where the transmitter sends a common message to both the legitimate user and the eavesdropper, a public message to the legitimate user on which there is no secrecy constraint, and a confidential message to the legitimate user which needs to kept perfectly secret from the eavesdropper.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2010•1 citation
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.
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.
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.
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, we first consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-taper also receives the transmitted signal. We assume that the signals are transmitted over additive white Gaussian noise channels. We characterize the secrecy capacity region of this channel. Our achievable coding scheme is based on superposition coding and the random binning. We refer to this scheme as secret superposition coding. The converse proof combines the converse proof for the conventional Gaussian broadcast channel and the perfect secrecy constraint. This capacity region matches the capacity region of the broadcast channel without security constraint. It also matches the secrecy capacity of the wire-tap channel. Based on the rate characterization of the secure Gaussian broadcast channel, we then use a multilevel coding approach for the slowly fading wire-tap. We assume that the transmitter only knows the eavesdropper's channel. In this approach, source node sends secure layered coding and the receiver viewed as a continuum ordered users. We derive optimum power allocation for the layers which maximizes the total average rate.
We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. Moreover, the legitimate user receives a private message, which is desired to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region of the Gaussian MIMO wiretap channel. This region contains all achievable common message, private message, and private message's equivocation rates. This capacity-equivocation region is equal to the capacity region of a Gaussian MIMO broadcast channel where the transmitter sends a common message to both the legitimate user and the eavesdropper, a public message to the legitimate user on which there is no secrecy constraint, and a confidential message to the legitimate user which needs to kept perfectly secret from the eavesdropper.