Secrecy Outage Capacity of Fading Channels

Gungor, Onur; Tan, Jian; Köksal, C. Emre; El-Gamal, Hesham; Shroff, Ness B.

doi:10.1109/tit.2013.2265691

Cited by 59 publications

(40 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], the effects of Nakagamim fading on SC and probability of non-zero secrecy capacity (PNSC) were investigated. Under two different assumptions on the transmitter channel state information, the definition of SC was extended to account for the secrecy constraint over Rayleigh-fading channels in [11]. In order to increase SC, the authors in [12] proposed a novel artificial noise based method to impair the source-eavesdropper channel.…”

Section: Introductionmentioning

confidence: 99%

Probability of Secrecy Outage in Cognitive Radio Networks over Rician-Fading Channels

Zhang

Jiang

Pan

2016

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

Abstract-In Rician-fading scenario, cognitive radio networks (CRNs) with a source in a secondary system transmitting its confidential information to a legitimate destination in the presence of an eavesdropper, are considered in this paper. Under CRNs, the interference power reaching at primary user (PU) is limited by some pre-defined threshold. Secrecy outage not only occurs when the achievable secrecy capacity for source-destination link is smaller than a target rate, but also occurs in the case that the interference power at PU is greater than that threshold. Analytical expression for secrecy outage probability has been derived and verified with simulation results. In addition, we have also derived the analytical expression for probability of non-zero secrecy capacity.

show abstract

Section: Introductionmentioning

confidence: 99%

Probability of Secrecy Outage in Cognitive Radio Networks over Rician-Fading Channels

Zhang

Jiang

Pan

2016

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

show abstract

“…For example, in [20] the secrecy degrees of freedom of multiantenna block fading (BF) coefficients were investigated by exploiting the temporal correlation of the BF channels seen by different receivers. Furthermore, in [21] distributed systems with linear precoding were studied while in [22] point-to-point secure communication over flat fading channels under outage constraints were considered. In the same contribution capacity achieving schemes based on opportunistically exchanging private keys between the legitimate nodes were proposed.…”

Section: Introductionmentioning

confidence: 99%

Optimal Power Allocation in Block Fading Channels With Confidential Messages

Chorti

Papadaki

Poor

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-The optimal power allocation for block fading (BF) networks with confidential messages is investigated under an M -block delay and power constraint. First, we study networks without channel state information (CSI) feedback to the transmitter and demonstrate that the optimal power allocation is the equidistribution of the power budget, denoted as the "blind policy". In blind scenarios secrecy can be achieved though receiver diversity; the probability of secrecy outage (PSO) is shown to decay exponentially with the the diversity order of the legitimate user. Then, we investigate networks with CSI feedback. For comparison purposes, we restate the acausal secure waterfilling algorithm with full CSI before moving to the causal feedback scenario. In the latter, an approximate "threshold policy" for the low SNR and an approximate "high power policy" for the high SNR regimes are derived. Furthermore, a novel universal transmission policy is proposed across all SNRs, denoted as the "blind horizon approximation" (BHA). Through numerical results, the BHA policy is shown to outperform both the threshold and high power policies when the legitimate user has an SNR advantage with respect to the eavesdropper, while it also compares well with the secure waterfilling policy.Index Terms-Secrecy capacity, probability of secrecy outage, block fading, BF-AWGN channel, causal channel state information feedback, dynamic program I. INTRODUCTION The increasing deployment of wireless networks introduces new challenges in the design of enhanced security next generation systems. A pressing need to develop alternative/complementary means to secure data exchange arises in many wireless settings with limited feedback and limited resources. Physical layer security (PLS) is an emerging technology from the area of information theory that can address open security issues in challenging wireless applications such as those envisaged for fifth generation (5G) networks. In PLS approaches [1], the issues of reliability and secrecy in the exchange of information are jointly addressed by employing novel double binning encoding schemes.PLS was pioneered by Wyner, who introduced the wiretap channel and established the possibility of creating perfectly secure communication links without relying on private (secret) keys [2]. Wyner termed the rates at which information can be transmitted secretly from the source to its intended destination as achievable secrecy rates, and the maximal achievable secrecy rate as the secrecy capacity (SC). Following Wyner's contribution, the SC of the scalar Gaussian wiretap channel was analyzed in [3]. In [4], Wyner's approach was generalized

show abstract

“…Thus, even when the instantaneous secrecy rate is zero, which is the case when the source-eavesdropper channel has better gain than that of the legitimate source-destination channel, data bits can still be transmitted to the destination securely from the eavesdropper. Based on this idea, Gungor et al [6] showed that a long-term constant secrecy rate is achievable. The authors of [6] address decoding delays but do not consider the dynamics of the data arrival process at the source.…”

Section: Introductionmentioning

confidence: 99%

“…Based on this idea, Gungor et al [6] showed that a long-term constant secrecy rate is achievable. The authors of [6] address decoding delays but do not consider the dynamics of the data arrival process at the source. Mao et al [7] assumed random data arrivals at the source node and illustrated through simulations that the use of a key queue reduces the queuing delay for the data packets.…”

Section: Introductionmentioning

confidence: 99%

On Secure Communications Over a Wiretap Channel With Fixed-Rate Transmission: Protocol Design and Queueing Analysis

Shafie

Al-Dhahir

2015

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

In this letter, we consider the wiretap channel when the source node maintains two buffers (queues) to store its data and secret key packets. We propose two medium-access protocols. In the first proposed protocol, we assume that the legitimate source and its destination share random secret key packets when the main channel is better than either the channel between the eavesdropper and the source or the channel between the eavesdropper and the destination. These key packets are stored in a separate key queue at the source and its destination, and are utilized to secure data packets, whenever the channel conditions favor the eavesdropper channels over the main communication channel. In the second proposed protocol, the source employs a random-access scheme based on the link states and the queue states. Our numerical results demonstrate the gains of our proposed protocols in terms of the mean service rate of the data queue and the average queueing delay of the data packets.

show abstract

Secrecy Outage Capacity of Fading Channels

Cited by 59 publications

References 23 publications

Probability of Secrecy Outage in Cognitive Radio Networks over Rician-Fading Channels

Probability of Secrecy Outage in Cognitive Radio Networks over Rician-Fading Channels

Optimal Power Allocation in Block Fading Channels With Confidential Messages

On Secure Communications Over a Wiretap Channel With Fixed-Rate Transmission: Protocol Design and Queueing Analysis

Contact Info

Product

Resources

About