Security and Communication Networks

Leakage‐probability‐constrained secrecy capacity of a fading channel

Zhi Chen, Dapeng Oliver Wu, Pingyi Fan, Khaled B. Letaief

Published Aug 2, 2011• 0 citations

Abstract

ABSTRACT Secure transmission of information over wireless channels in the presence of an eavesdropper has attracted much attention recently. Previous work assumes that a transmitter has perfect knowledge of the channel side information (CSI) of the legitimate channel and the eavesdropper's channel. To loosen this strong requirement, this paper considers the case where a transmitter has perfect knowledge of the CSI of the legitimate channel and only the average channel gain of the eavesdropper's channel. In this case, some information may be leaked to the eavesdropper because the eavesdropper's channel may have a higher gain than the legitimate channel. Hence, we propose, for the first time, to study leakage‐probability‐constrained secrecy capacity of a fading channel, that is, secrecy capacity under the constraint on leakage probability. We also propose an optimal power allocation strategy that maximizes leakage‐probability‐constrained secrecy capacity under average power constraint. Moreover, we study the impact of the bias of the average gain estimate of the eavesdropper's channel on leakage‐probability‐constrained secrecy capacity. Copyright © 2011 John Wiley & Sons, Ltd.

DOI: 10.1002/sec.353

Related papers

Secrecy Capacity with Leakage Constraints in Fading Channels

Zhi Chen, Pingyi Fan, Dapeng Oliver Wu +1 more

The secure transmission of information over wireless systems in the presence of an eavesdropper has attracted much attention. In this paper, we consider the case that full CSI of the legitimate user but only the average channel gain of the eavesdropper is known at the transmitter. In such setting, some information will be inevitably leaked to the eavesdropper from the information-theoretic view and this was not quantitatively evaluated before. A secrecy transmission framework with leakage threshold is thereby proposed. The secrecy capacity satisfying this leakage probability constraints is derived along with an optimal power allocation strategy. For Rayleigh and Nakagami-m fading channels, numerical results indicate that our framework can work well with transmitter knowledge of only average channel gain of the eavesdropper.

GlobecomDec 1, 20103 citations

On the Secrecy Capacity of Fading Channels

Praveen Kumar Gopala, Lifeng Lai, Hesham El Gamal

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.

IEEE Transactions on Information TheorySep 18, 20081,259 citations

On the Secrecy Capacity of Fading Channels

Praveen Kumar Gopala, Lifeng Lai, Hesham El Gamal

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full Channel State Information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average SNR goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Remarkably, our results reveal the positive impact of fading on the secrecy capacity and establish the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels.

arXiv:cs/0610103Oct 17, 200654 citations

On the Secrecy Capacity of Fading Channels

Praveen Kumar Gopala, Lifeng Lai, Hesham El Gamal

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We analyze the full Channel State Information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and eavesdropper, and the main channel CSI scenario, where only the legitimate receiver channel gain is known at the transmitter. In each scenario, the secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average SNR goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Remarkably, our results reveal the positive impact of fading on the secrecy capacity and establish the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 2007100 citations

Secrecy outage capacity of fading channels

Onur Güngör, Jian Rong Tan, C. Emre Koksal +2 more

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter CSI (Channel state information). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.

Conference on Information Sciences and SystemsMar 1, 201214 citations

Secrecy Outage Capacity of Fading Channels

Onur Güngör, Jian Rong Tan, C. Emre Koksal +2 more

This paper considers point-to-point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under two different assumptions on the transmitter channel state information (CSI). First, we find the outage secrecy capacity assuming that the transmitter has perfect knowledge of the legitimate and eavesdropper channel gains. In this scenario, the capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes. These keys are stored in a key buffer and later used to secure delay sensitive data using the Vernam's one time pad technique. We then extend our results to the more practical scenario where the transmitter is assumed to know only the legitimate channel gain. Here, our achievability arguments rely on privacy amplification techniques to generate secret key bits. In the two cases, we also characterize the optimal power control policies which, interestingly, turn out to be a judicious combination of channel inversion and the optimal ergodic strategy. Finally, we analyze the effect of key buffer overflow on the overall outage probability.

IEEE Transactions on Information TheoryAug 1, 201362 citations