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

IEEE International Symposium on Information Theory (ISIT)

On secrecy outage capacity of fading channels under relaxed delay constraints

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

Published Jul 1, 2013• 1 citation
Publisher

Abstract

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.

DOI
10.1109/isit.2013.6620581

Related papers

On the delay limited secrecy capacity of fading channels

Karim Khalil, Moustafa 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.

arXiv:0901.2616•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•24 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.

arXiv:1112.2791•IEEE Transactions on Information Theory•Aug 1, 2013•65 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

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 Systems•Mar 1, 2012•13 citations

Secrecy capacity and secure outage performance for rayleigh fading simo channel

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

In this paper, we consider the problem of secret communication through Rayleigh fading single-input multiple-output (SIMO) broadcast channel in the presence of an eavesdropper. At first, we define the ergodic secrecy capacity and find the optimal power allocation at the transmitter that achieves the secrecy capacity for the full channel state information (CSI) case, where transmitter has access to both the main channel and eavesdropper's channel gains, and for the case of only main channel CSI at the transmitter. Then, we define the secrecy capacity in case of open-loop transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. We also find the analytical expression for secure outage probability to study the secure outage performance of the proposed model.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2011•9 citations

Secure Communications over Wireless Networks

Md. Zahurul I. Sarkar

Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.

IGI Global eBooks•Jan 1, 2012•0 citations
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.
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.
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.
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.
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 paper, we consider the problem of secret communication through Rayleigh fading single-input multiple-output (SIMO) broadcast channel in the presence of an eavesdropper. At first, we define the ergodic secrecy capacity and find the optimal power allocation at the transmitter that achieves the secrecy capacity for the full channel state information (CSI) case, where transmitter has access to both the main channel and eavesdropper's channel gains, and for the case of only main channel CSI at the transmitter. Then, we define the secrecy capacity in case of open-loop transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. We also find the analytical expression for secure outage probability to study the secure outage performance of the proposed model.
Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.