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• 6 citations

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 1

Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramch

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 which is independent of the sources. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution and prove its optimality for the parallel channels and sources case when each sub-channel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper). This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated. I.

Mar 17, 201141 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.0942IEEE Transactions on Information TheoryJul 13, 201231 citations

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, 200841 citations

Achieving Secret Communication for

Li Zang, 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 Am- plitude 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.

Jan 1, 20100 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 IsraelNov 1, 20164 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 CommunicationsAug 24, 201060 citations