Secrecy Transmission on Block Fading Channels: Theoretical Limits and Performance of Practical Codes
Authors:
Preprint
Abstract
We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob), while keeping a third agent (Eve) in the dark, by using physical layer techniques. For a transmission over frequency non selective block fading channels, we assume that Alice perfectly knows the channel with respect to Bob, but she has only a statistical knowledge of the channel with respect to Eve. We derive bounds on the achievable outage secrecy rates, considering messages spanning either one or many fading blocks. Transmit power is adapted to fading conditions, with a constraint on the average power over the entire transmission. We also focus on the maximum cumulative outage secrecy rate that can be achieved. In order to assess the performance in a practical scenario, we consider transmissions encoded with practical error correcting codes. In particular, we extend the definitions of both security gap and equivocation rate - previously applied to the additive white Gaussian noise channel - to fading channels, taking into account the error rate targets. Bounds on these performance metrics are derived for a block Rayleigh fading channel. Numerical results are provided, confirming the feasibility of the considered physical layer security techniques.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- On Secrecy Rate of the Generalized Artificial-Noise Assisted Secure Beamforming for Wiretap ChannelsIEEE Journal on Selected Areas in Communications, 2013
- Physical-Layer Secrecy for OFDM Transmissions Over Fading ChannelsIEEE Transactions on Information Forensics and Security, 2012
- Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap AnalysisIEEE Transactions on Information Forensics and Security, 2012
- Coding for Cryptographic Security Enhancement Using Stopping SetsIEEE Transactions on Information Forensics and Security, 2011
- Secret-Sharing LDPC Codes for the BPSK-Constrained Gaussian Wiretap ChannelIEEE Transactions on Information Forensics and Security, 2011
- On Gaussian wiretap channels with M-PAM inputs2010
- Sphere-Packing Bounds Revisited for Moderate Block LengthsIEEE Transactions on Information Theory, 2004
- All-or-nothing encryption and the package transform1997
- Iterative decoding of binary block and convolutional codesIEEE Transactions on Information Theory, 1996
- Probability of Error for Optimal Codes in a Gaussian ChannelBell System Technical Journal, 1959