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

arXiv:0901.2616 · IEEE International Symposium on Information Theory (ISIT)

On the delay limited secrecy capacity of fading channels

Karim Khalil, Moustafa Youssef, O. Ozan Koyluoglu, Hesham El Gamal

Published Jun 1, 2009• 25 citations
arXivHTMLPDF

Abstract

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated 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 secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.

DOI
10.1109/isit.2009.5205955

Related papers

On the delay limited secrecy capacity of fading channels

Karim Khalil, Moustafa A. Youssef, O. Ozan Koyluoglu +1 more

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated 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 secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.

•Jan 1, 2009•26 citations

Opportunistic Secrecy with a Strict Delay Constraint

Karim Khalil, O. Ozan Koyluoglu, Hesham El Gamal +1 more

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.

arXiv:0907.3341•IEEE Transactions on Communications•Nov 1, 2013•22 citations

On secrecy outage capacity of fading channels under relaxed delay constraints

Onur Güngör, C. Emre Koksal, Hesham El Gamal

We consider information theoretic secrecy over flat fading channels under relaxed delay constraints. More specifically, we extend the definition of outage secrecy capacity for single-input single-output single-eavesdropper case (SISOSE) to account for relaxed delay constraints, and study the fundamental limits under two different assumptions on the transmitter CSI (channel state information). First, we provide bounds on secrecy outage capacity with k+1 block delay constraint. We show that the bounds are tight for several special cases. We also provide a weaker lower bound that is easier to compute, and show that under low SNR, delay constraint has significant impact on secrecy outage capacity. The analysis serves as an important step towards complete characterization of information theoretic security with delay and outage constraints.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•1 citation

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 Theory•Aug 1, 2013•62 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.

arXiv:1112.2791•Dec 13, 2011•4 citations

A Secure Method for Transmission of Sensitive Data over Wireless Fading Channels

B. Kavitha, K. S. Yuvaraj

In this project, the Delay-Sensitive data capacity of the Wireless fading channel is explored under two distinct suppositions on the accessible transmitter channel state data (CSI). The principal situation accept consummate earlier learning of both the fundamental and spy channel picks up. Here, upper and lower limits on the protected delay constrained limit are inferred and appeared to be tight in the high flag to-clamor proportion (SNR) administration (for a wide class of channel circulations). In the second situation, just the principle channel CSI is thought to be accessible at the transmitter. Amazingly, under this suspicion, I build up the achievability of non-zero secure rate (for a wide class of channel circulations) under a strict delay limitation. In the two cases, our achievability contentions depend on a novel two phase approach that defeats the mystery blackout wonder saw in before works.

International Journal of Scientific Research in Computer Science Engineering and Information Technology•Apr 30, 2018•0 citations
In this paper, the delay limited secrecy capacity of the flat fading channel is investigated 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 secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.
In this paper, the delay limited secrecy capacity of the flat fading channel is investigated 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 secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.
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.
We consider information theoretic secrecy over flat fading channels under relaxed delay constraints. More specifically, we extend the definition of outage secrecy capacity for single-input single-output single-eavesdropper case (SISOSE) to account for relaxed delay constraints, and study the fundamental limits under two different assumptions on the transmitter CSI (channel state information). First, we provide bounds on secrecy outage capacity with k+1 block delay constraint. We show that the bounds are tight for several special cases. We also provide a weaker lower bound that is easier to compute, and show that under low SNR, delay constraint has significant impact on secrecy outage capacity. The analysis serves as an important step towards complete characterization of information theoretic security with delay and outage constraints.
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.
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.
In this project, the Delay-Sensitive data capacity of the Wireless fading channel is explored under two distinct suppositions on the accessible transmitter channel state data (CSI). The principal situation accept consummate earlier learning of both the fundamental and spy channel picks up. Here, upper and lower limits on the protected delay constrained limit are inferred and appeared to be tight in the high flag to-clamor proportion (SNR) administration (for a wide class of channel circulations). In the second situation, just the principle channel CSI is thought to be accessible at the transmitter. Amazingly, under this suspicion, I build up the achievability of non-zero secure rate (for a wide class of channel circulations) under a strict delay limitation. In the two cases, our achievability contentions depend on a novel two phase approach that defeats the mystery blackout wonder saw in before works.