On the delay limited secrecy capacity of fading channels

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

doi:10.1109/isit.2009.5205955

Cited by 24 publications

(36 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was shown in [6] that, one can avoid a secrecy outage over block t, even when R s (t) = 0 by introducing private key queues at the transmitter and the receiver. Our system, depicted in Fig.…”

Section: B Key Queue Modelmentioning

confidence: 99%

“…It is well known that, the method of sending secure information using the binning techniques inspired by the wiretap channel fails to secure the information at times when the eavesdropper channel has favorable conditions over the main channel, hence the delay 1 -limited secrecy capacity is 0, since outages are unavoidable. It was shown in [6] that, interestingly, a nonzero secrecy rate could be achieved by introducing private key queues at both the transmitter and the receiver. The work exploits the times at which the main channel is favorable over the eavesdropper channel to transmit some random private key bits along with the data bits.…”

Section: Introductionmentioning

confidence: 99%

“…When the main channel has a worse channel gain than the eavesdropper, by consuming these shared keys (simply using bit-wise EXOR operation), the transmitter can confuse the eavesdropper, despite the limited main-channel rate. However, while [6] investigates the basic limitations of such a system, the optimal power and rate control policy and the queue dynamics of the key buffer are not studied. Furthermore, the system only works for "invertible" channels.…”

Section: Introductionmentioning

confidence: 99%

“…To that end, we develop a delay-limited secure communication system with private key queues similar to the ones in [6]. In particular, we investigate the optimal rate and power control problem at the physical layer as well as the queueing dynamics of the private key queue.…”

Section: Introductionmentioning

confidence: 99%

“…We specifically focus on scenarios that are difficult to analyze. For example, the upper bound of the delay limited secrecy capacity derived in [6] only depends on main channel and eavesdropper channel gains without any power constraint. However, with a finite average power constraint, there is significant difference between the upper and lower bound, especially in the low power region, to delay limited capacity.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Joint Power and Secret Key Queue Management for Delay Limited Secure Communication

Gungor

Tan

Köksal

et al. 2010

2010 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

Abstract-In recent years, the famous wiretap channel has been revisited by many researchers and information theoretic secrecy has become an active area of research in this setting. In this paper, we design a wireless communication system that achieves constant bit rate data transmission over a block fading channel, securely from an eavesdropper that listens to the transmitter over another independent block fading channel. It is well known that, the method of sending secure information using the binning techniques inspired by the wiretap channel fails to secure the information at times when the eavesdropper channel has favorable conditions over the main channel. This phenomenon is called secrecy outage. In our system, however, we exploit the times at which the main channel is favorable over the eavesdropper channel for us to be able to transmit some random secret key bits along with the data bits. These key bits are stored in a separate key buffer at the transmitter as well as the receiver, and are utilized to secure data bits, whenever the channel conditions favor the eavesdropper. We show that, using our system the outage probability can be made arbitrarily close to 0 by jointly controlling the key buffer with the transmit power. We show that the optimal power control involves a time sharing between secure waterfilling and channel inversion strategies and the key buffer needs to operate in the heavy traffic regime to achieve the maximum delay limited rate possible, under a small outage constraint. This work can be viewed as a first step in providing a framework that combines both information theory and queueing analysis for the study of information theoretic security.

show abstract

Section: B Key Queue Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Joint Power and Secret Key Queue Management for Delay Limited Secure Communication

Gungor

Tan

Köksal

et al. 2010

2010 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

show abstract

Cooperative Secondary Encryption for Primary Privacy Preserving in Cognitive Radio Networks

Wang

Zhang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Aiming at protecting primary privacy messages and supporting secondary quality-of-service (QoS), we propose a secondary encrypted secure strategy for cognitive radio networks. In this scheme, a primary system directly transmits privacy messages or employs pre-transmitted secure secondary messages to encrypt the primary privacy information, and the secondary system acquires a fraction of the interference-free licensed spectrum. Following this idea, we consider two secure communication scenarios: the non-buffer scenario and the buffer-aided scenario. For the non-buffer scenario, the primary system first evaluates the channel quality of the direct transmission link. Then, the primary transmitter adaptively chooses to directly transmit the privacy messages or employ the encryption of the secure secondary messages according to the evaluation results. For this scenario, we investigate the primary ergodic secrecy performance and the secondary average performance. For the buffer-aided scenario, the secure secondary messages can be stored in the buffers at both the primary transmitter and receivers. According to the buffer states and channel quality, the primary system adaptively chooses to directly transmit the primary privacy information, permit the secondary secure transmission, or utilize the encryption of the stored secure secondary information. For this scenario, we also investigate the performances of both the primary and secondary systems, and derive the closed-form expression of the primary information delay. Numerical results are given to prove that the proposed scheme can provide privacy preserving for the primary information and acquire high secondary average transmission rate. INDEX TERMS Cognitive radio networks, primary information security, secondary transmission rate.

show abstract

Towards achieving full secrecy rate and low delays in wireless networks

Mao

Köksal

Shroff

2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

We consider a single-user secure data communication system. Data packets arriving at the transmitter are enqueued at a data queue to be transmitted to the receiver over a block fading channel, securely from an eavesdropper that listens to the transmitter over another independent block fading channel. Part of the data is secured by the available secrecy rate while the other part is encrypted by the key bits, enqueued at both the transmitter and the receiver. We first address two separate problems in this paper: (1) with an average power constraint, given any sample path of arrivals, how to admit the arrivals and allocate power such that the long term average secrecy rate is maximized and the maximum admission rate is achieved while the data queue is kept stable; (2) with infinite queue backlog, given any sample path of secrecy rate, how to control the data transmission rate and key generation such that a smooth transmission rate and then a small queueing delay are achieved. We propose a power controller, transmission controller and an admission controller based on simple index policies that do not rely on any prior statistical information on the data arrival process and channel conditions. We show that our controllers have a provably efficient performance and solve the above two problems simultaneously. Furthermore, for any given secrecy rate sample path and correspondingly admissible arrival, we provide a rate allocation policy which is sample-path queueing-delay optimal.

show abstract

On the delay limited secrecy capacity of fading channels

Cited by 24 publications

References 11 publications

Joint Power and Secret Key Queue Management for Delay Limited Secure Communication

Joint Power and Secret Key Queue Management for Delay Limited Secure Communication

Cooperative Secondary Encryption for Primary Privacy Preserving in Cognitive Radio Networks

Towards achieving full secrecy rate and low delays in wireless networks

Contact Info

Product

Resources

About