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 Conference on Communications workshops

Gaussian wiretap channels with correlated sources: Approaching capacity region within a constant gap

Yanling Chen, Hendrik Vogt, Aydin Sezgin

Published Jun 1, 2014• 7 citations
Publisher

Abstract

This paper studies the Gaussian wiretap channel with correlated sources available not only at the transmitter and legitimate receiver, but also the eavesdropper. In particular, we are interested in the open problem of finding the optimal auxiliary random variable, which provides a closed-form solution to the secret-message and secret-key capacity region. To do that, we first take a deterministic approach and give a precise characterization of its secrecy capacity region. Then we translate the insights gained to the Gaussian case. As a result, we provide a sub-optimal solution by employing a specified Gaussian choice of the auxiliary random variable. This suggested choice is a compromise of keeping most source information subject to the constraint imposed by the channel capability of conducting source coding. Nevertheless, it is shown to be able to approach the secrecy capacity region within half a bit as the signal-noise-ratio of the main channel is no less than 1.

DOI
10.1109/iccw.2014.6881297

Related papers

A New Outer Bound for the Secrecy Capacity Region of the Gaussian Two-Way Wiretap Channel

Xiao Hui He, Aylin Yener

We investigate the fundamental communication limits when messages are sent via a Gaussian two-way channel, which must at the same time be kept secret from an external eavesdropper. In this two-way wiretap channel that models two legitimate transceivers and an eavesdropping receiver, there are two techniques to provide confidentiality for the messages: one entails the legitimate nodes to jam the eavesdropper, i.e., cooperative jamming, while the other entails generating keys from the feedback signals received by the two legitimate nodes and using them to encrypt the messages. Previous work has shown that both methods can be used concurrently to improve the secrecy rates of a channel with a degradedness condition. In this work, we consider the general case, and derive a new outer bound for the secrecy capacity region of this channel. A case is identified where the loss in secrecy rate, due to ignoring the backward (feedback) link at each legitimate transmitter from the other, is bounded by a constant which only depends on the channel gains. This is the case when the power of the two legitimate nodes increases proportionally. In all other cases, we show that ignoring feedback signals causes unbounded loss in the secrecy rate. The loss is measured as the gap between the achievable rate when the feedback signals are taken into account, and the upper bound when the feedback is not used, and hence is not affected by the choice of the achievable scheme. This result therefore establishes that, for the Gaussian two-way channel with an external eavesdropper, the encoders need to be designed with memory. This is in contrast to the result for this channel in the absence of an eavesdropper.

International Conference on Communications•May 1, 2010•13 citations

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

Capacity-Equivocation Region of the Gaussian MIMO Wiretap Channel

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. In addition to this common message, 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 (secrecy) rates. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due to Csiszar–Korner.

arXiv:1005.0419•IEEE Transactions on Information Theory•Jun 12, 2012•24 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•28 citations

Secret-Key Generation Using Correlated Sources and Channels

Ashish J. Khisti, Suhas N. Diggavi, Gregory W. Wornell

We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.

arXiv:0906.1835•IEEE Transactions on Information Theory•Feb 1, 2012•55 citations

1 Secret-Key Generation using Correlated Sources and Channels

Ashish J. Khisti, Student Member, Suhas N. Diggavi +1 more

Abstract—We study the secret-key capacity in a joint source-channel coding setup—the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input. Index Terms—Information theoretic security, joint sourcechannel coding, public discussion, secret-key agreement, wiretap channel. I.

•Jan 1, 2011•56 citations
This paper studies the Gaussian wiretap channel with correlated sources available not only at the transmitter and legitimate receiver, but also the eavesdropper. In particular, we are interested in the open problem of finding the optimal auxiliary random variable, which provides a closed-form solution to the secret-message and secret-key capacity region. To do that, we first take a deterministic approach and give a precise characterization of its secrecy capacity region. Then we translate the insights gained to the Gaussian case. As a result, we provide a sub-optimal solution by employing a specified Gaussian choice of the auxiliary random variable. This suggested choice is a compromise of keeping most source information subject to the constraint imposed by the channel capability of conducting source coding. Nevertheless, it is shown to be able to approach the secrecy capacity region within half a bit as the signal-noise-ratio of the main channel is no less than 1.
We investigate the fundamental communication limits when messages are sent via a Gaussian two-way channel, which must at the same time be kept secret from an external eavesdropper. In this two-way wiretap channel that models two legitimate transceivers and an eavesdropping receiver, there are two techniques to provide confidentiality for the messages: one entails the legitimate nodes to jam the eavesdropper, i.e., cooperative jamming, while the other entails generating keys from the feedback signals received by the two legitimate nodes and using them to encrypt the messages. Previous work has shown that both methods can be used concurrently to improve the secrecy rates of a channel with a degradedness condition. In this work, we consider the general case, and derive a new outer bound for the secrecy capacity region of this channel. A case is identified where the loss in secrecy rate, due to ignoring the backward (feedback) link at each legitimate transmitter from the other, is bounded by a constant which only depends on the channel gains. This is the case when the power of the two legitimate nodes increases proportionally. In all other cases, we show that ignoring feedback signals causes unbounded loss in the secrecy rate. The loss is measured as the gap between the achievable rate when the feedback signals are taken into account, and the upper bound when the feedback is not used, and hence is not affected by the choice of the achievable scheme. This result therefore establishes that, for the Gaussian two-way channel with an external eavesdropper, the encoders need to be designed with memory. This is in contrast to the result for this channel in the absence of an eavesdropper.
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 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. In addition to this common message, 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 (secrecy) rates. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due to Csiszar–Korner.
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 secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.
Abstract—We study the secret-key capacity in a joint source-channel coding setup—the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input. Index Terms—Information theoretic security, joint sourcechannel coding, public discussion, secret-key agreement, wiretap channel. I.