Computer Science – Information Theory
Scientific paper
2011-12-13
Computer Science
Information Theory
submitted to IEEE Transactions on Information Theory
Scientific paper
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.
Gamal Hesham El
Gungor Onur
Koksal Can Emre
Shroff Ness B.
Tan Jian
No associations
LandOfFree
Secrecy Outage Capacity of Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Secrecy Outage Capacity of Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secrecy Outage Capacity of Fading Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-485749