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:1112.2791 · IEEE Transactions on Information Theory

Secrecy Outage Capacity of Fading Channels

Onur Güngör, Jian Rong Tan, C. Emre Koksal, Hesham El-Gamal, Ness B. Shroff

Published Aug 1, 2013• 65 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tit.2013.2265691

Related papers

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

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

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

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

Information theory enabled secure wireless communication, key generation and authentication

Onur Güngör

The rapid growth in wireless communication systems has provided a flexibility of communication and content that has had a transformative impact to all aspects of society.However, the broadcast nature of the wireless medium makes these systems vulnerable to passive attacks in which the adversary attempts to eavesdrop on the transmitted messages, and to active attacks in which the adversary can intelligently manipulate legitimate transmissions, both of which can jeopardize a myriad of critical wireless services.Hence, it is imperative to design wireless networks with safeguards in place to ensure their resilience to attacks.To that end, this dissertation provides various perspectives in the domain of information theoretic secrecy and authentication, which provably guarantees security, regardless of the computational capabilities of the adversary.We strive to bridge the gap between the information theory of security and the practically implementable protocols within this paradigm.We first consider point to point secure communication over flat fading wireless channels under delay constraint.We extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under different assumptions on the transmitter channel state information (CSI).The capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes.These keys are stored in a key buffer and used to secure delay sensitive data.We also characterize the optimal 4.5 Multiple Preauthenticated Helpers . . . . . . . . . . . . . . . . . . .

•Jan 1, 2014•1 citation

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.

arXiv:cs/0610103•IEEE Transactions on Information Theory•Sep 18, 2008•1,252 citations
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 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 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.
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.
The rapid growth in wireless communication systems has provided a flexibility of communication and content that has had a transformative impact to all aspects of society.However, the broadcast nature of the wireless medium makes these systems vulnerable to passive attacks in which the adversary attempts to eavesdrop on the transmitted messages, and to active attacks in which the adversary can intelligently manipulate legitimate transmissions, both of which can jeopardize a myriad of critical wireless services.Hence, it is imperative to design wireless networks with safeguards in place to ensure their resilience to attacks.To that end, this dissertation provides various perspectives in the domain of information theoretic secrecy and authentication, which provably guarantees security, regardless of the computational capabilities of the adversary.We strive to bridge the gap between the information theory of security and the practically implementable protocols within this paradigm.We first consider point to point secure communication over flat fading wireless channels under delay constraint.We extend the definition of outage capacity to account for the secrecy constraint and obtain sharp characterizations of the corresponding fundamental limits under different assumptions on the transmitter channel state information (CSI).The capacity achieving scheme relies on opportunistically exchanging private keys between the legitimate nodes.These keys are stored in a key buffer and used to secure delay sensitive data.We also characterize the optimal 4.5 Multiple Preauthenticated Helpers . . . . . . . . . . . . . . . . . . .
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.