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

Asilomar Conference on Signals, Systems and Computers (ACSSC)

Secret communication using sources and channels

Krishnan Eswaran, Vinod M. Prabhakaran, Kannan Ramchandran

Published Oct 1, 2008• 5 citations
Publisher

Abstract

Alice wants to send Bob a secret message in the presence of an eavesdropper Eve. Alice has two resources available: a noisy broadcast channel and source observations correlated with observations at Bob and Eve. We consider two cases, the first in which the source observations and channel are independent and the second in which they can depend on each other. For the independent case, we consider a strategy that exploits the sources and channels separately and show this separation strategy is optimal for a class of sources and channels that includes a Gaussian example. For the case in which the sources and channels depend on each other, this separation strategy does not work, and an optimal strategy has yet to be established. For this setting, we improve on the best known upper bound to the secret message capacity.

DOI
10.1109/acssc.2008.5074492

Related papers

Secrecy via sources and channels — A secret key - Secret message rate tradeoff region

Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramchandran

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two resources are available — correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve. No other resource, in particular, no other channel is available. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution based on a separation architecture and prove its optimality under three settings: when Eve’s source and channel are degraded versions of Bob’s, and either Bob’s source or channel is by itself useless in generating a secret key.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•39 citations

Secrecy via Sources and Channels

Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramchandran

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. This problem of secret communication and secret-key generation when two resources are available-correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources is studied. The goal is to characterize the fundamental tradeoff between the rates of the secret message and secret key. An achievable solution and proof of its optimality for the parallel channels and sources case when each subchannel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper) is presented. This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated.

arXiv:0807.0942•IEEE Transactions on Information Theory•Jul 13, 2012•31 citations

The Gaussian wiretap channel with correlated sources at the terminals: Secret communication and key generation

Alexander Bunin, Pablo Piantanida, Shlomo Shitz Shamai

This paper considers the setup of Alice, Bob and Eve sharing a Gaussian Broadcast channel, and correlated Gaussian sources, assuming these are independent of the channel components. Both secret key generation and secret message transmission are considered. A closed form expression is presented characterizing the optimal trade-off between the secret key and the secret message rates. A few known results are shown to be accepted as special cases.

IEEE Convention of Electrical and Electronics Engineers in Israel•Nov 1, 2016•5 citations

Achieving Secret Communication for Fast Rayleigh Fading Channels

Zang Li, Roy D. Yates, Wade K. Trappe

We consider a secret communication scenario where Alice wants to transmit secretly to Bob in presence of a passive eavesdropper Eve. The Alice-Bob channel is a fixed-SNR AWGN channel, while the Alice-Eve channel is a fast Rayleigh fading channel, with the channel states only known to Eve. Alice knows the statistics of Alice-Eve channel, but not the exact realizations. We investigate the achievable secrecy rates for this channel model with Gaussian signaling and discrete signaling. For Gaussian signaling, several transmission strategies according to the main channel's relative channel gain are proposed and evaluated. For discrete signaling, achievable secrecy rates with Quadrature Amplitude Modulation (QAM) are evaluated. When Bob's channel is much better than Eve's channel, simple Gaussian signaling can perform close to the upper bound, and is better than the rate achieved with M-QAM. When Bob's channel gain is on average worse than the eavesdropper's average channel gain, positive secrecy rate can still be achieved for Gaussian signaling with artificial noise injection and a burst signaling strategy. Moreover, M-QAM can outperform Gaussian signaling. The key factor that enables secret communication in this case is that both M-QAM and artificial noise limit the leakage of information when Eve's channel is unusually good.

IEEE Transactions on Wireless Communications•Aug 24, 2010•58 citations

The role of an untrusted relay in secret communication

Xiang He, Aylin Yener

We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. A class of relay channels with orthogonal components is considered and an upper bound on the secrecy rate is derived. For the class of relay channels in consideration, we prove the relay and the eavesdropper can be separated to obtain an ‘enhanced’ channel in terms of secrecy capacity. We then consider two special cases of this channel model: (i) the Gaussian orthogonal relay channel, and (ii) the Gaussian Cover-Kim deterministic relay channel. For the former, the upper bound found is tighter than the previously known bound. For the latter, we show that the bound yields the secrecy capacity when the source-destination link is not worse than the source-relay link. This second case also provides the first example where secrecy capacity is achieved with compress and-forward at the relay.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•21 citations

Perfect cryptographic security from partially independent channels

Ueli M. Maurer

Several protocols are presented that allow two parties Alice and Bob not sharing any secret information initially (except possibly a short key to be used for authentication) to generate a long shared secret key such that even an enemy Eve with unlimited computing power is unable to obtain a non-negligible amount of information (in Shannon's sense) about this key. Two different models are considered. In a first model we assume that Alice can send information to Bob over a noisy main channel but that Eve is able to receive the same information over a parallel independent noisy channel from Alice to Eve. In a second, more general model we assume that Alice, Bob and Eve receive the output of a random source (e.g., a satellite broadcasting random bits) over three independent individual channels. The condition that the channels be independent can be replaced by the condition that they be independent only to a known, arbitrarily small degree. We demonstrate that even when Eve's channel is sup...

ACM Symposium on Theory of Computing (STOC)•Jan 1, 1991•43 citations
Alice wants to send Bob a secret message in the presence of an eavesdropper Eve. Alice has two resources available: a noisy broadcast channel and source observations correlated with observations at Bob and Eve. We consider two cases, the first in which the source observations and channel are independent and the second in which they can depend on each other. For the independent case, we consider a strategy that exploits the sources and channels separately and show this separation strategy is optimal for a class of sources and channels that includes a Gaussian example. For the case in which the sources and channels depend on each other, this separation strategy does not work, and an optimal strategy has yet to be established. For this setting, we improve on the best known upper bound to the secret message capacity.
Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two resources are available — correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve. No other resource, in particular, no other channel is available. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution based on a separation architecture and prove its optimality under three settings: when Eve’s source and channel are degraded versions of Bob’s, and either Bob’s source or channel is by itself useless in generating a secret key.
Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. This problem of secret communication and secret-key generation when two resources are available-correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources is studied. The goal is to characterize the fundamental tradeoff between the rates of the secret message and secret key. An achievable solution and proof of its optimality for the parallel channels and sources case when each subchannel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper) is presented. This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated.
We consider a secret communication scenario where Alice wants to transmit secretly to Bob in presence of a passive eavesdropper Eve. The Alice-Bob channel is a fixed-SNR AWGN channel, while the Alice-Eve channel is a fast Rayleigh fading channel, with the channel states only known to Eve. Alice knows the statistics of Alice-Eve channel, but not the exact realizations. We investigate the achievable secrecy rates for this channel model with Gaussian signaling and discrete signaling. For Gaussian signaling, several transmission strategies according to the main channel's relative channel gain are proposed and evaluated. For discrete signaling, achievable secrecy rates with Quadrature Amplitude Modulation (QAM) are evaluated. When Bob's channel is much better than Eve's channel, simple Gaussian signaling can perform close to the upper bound, and is better than the rate achieved with M-QAM. When Bob's channel gain is on average worse than the eavesdropper's average channel gain, positive secrecy rate can still be achieved for Gaussian signaling with artificial noise injection and a burst signaling strategy. Moreover, M-QAM can outperform Gaussian signaling. The key factor that enables secret communication in this case is that both M-QAM and artificial noise limit the leakage of information when Eve's channel is unusually good.
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. A class of relay channels with orthogonal components is considered and an upper bound on the secrecy rate is derived. For the class of relay channels in consideration, we prove the relay and the eavesdropper can be separated to obtain an ‘enhanced’ channel in terms of secrecy capacity. We then consider two special cases of this channel model: (i) the Gaussian orthogonal relay channel, and (ii) the Gaussian Cover-Kim deterministic relay channel. For the former, the upper bound found is tighter than the previously known bound. For the latter, we show that the bound yields the secrecy capacity when the source-destination link is not worse than the source-relay link. This second case also provides the first example where secrecy capacity is achieved with compress and-forward at the relay.
Several protocols are presented that allow two parties Alice and Bob not sharing any secret information initially (except possibly a short key to be used for authentication) to generate a long shared secret key such that even an enemy Eve with unlimited computing power is unable to obtain a non-negligible amount of information (in Shannon's sense) about this key. Two different models are considered. In a first model we assume that Alice can send information to Bob over a noisy main channel but that Eve is able to receive the same information over a parallel independent noisy channel from Alice to Eve. In a second, more general model we assume that Alice, Bob and Eve receive the output of a random source (e.g., a satellite broadcasting random bits) over three independent individual channels. The condition that the channels be independent can be replaced by the condition that they be independent only to a known, arbitrarily small degree. We demonstrate that even when Eve's channel is sup...