Computer Science – Information Theory
Scientific paper
2009-07-20
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory
Scientific paper
We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the delay limited secrecy capacity are derived, and shown to be tight in the high signal-to-noise ratio (SNR) regime. In the second scenario, only the main channel CSI is assumed to be available at the transmitter where, remarkably, we establish the achievability of a non-zero delay-limited secure rate, for a wide class of channel distributions, with a high probability. In the two cases, our achievability arguments are based on a novel two-stage key-sharing approach that overcomes the secrecy outage phenomenon observed in earlier works.
Gamal Hesham El
Khalil Karim
Koyluoglu Onur Ozan
Youssef Moustafa
No associations
LandOfFree
Opportunistic Secrecy with a Strict Delay Constraint 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 Opportunistic Secrecy with a Strict Delay Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Opportunistic Secrecy with a Strict Delay Constraint will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696035