LDPC codes for physical layer security

Authors:
Demijan Klinc;Jeongseok Ha;Steven W. McLaughlin;João Barros;Byung-Jae Kwak
Affiliations:
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta;School of Electrical and Computer Engineering, Information and Communications University, Daejeon, Korea;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta;Instituto de Telecomunicações, Departamento de Engenharia Electrotécnica e de Computadores Faculdade de Engenharia da Universidade do Porto, Portugal;Electronics and Telecommunications Research Institute, Daejeon, Korea
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 8
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Tandem coding and cryptography on wiretap channels: EXIT chart analysis

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Modern Coding Theory

Modern Coding Theory
Physical-layer security: combining error control coding and cryptography

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes

IEEE Transactions on Information Theory
The Wiretap Channel With Feedback: Encryption Over the Channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes. The messages are transmitted over punctured bits to hide data from eavesdroppers. It is shown that this method is asymptotically effective in the sense that it yields a BER very close to 0.5 for an eavesdropper whose SNR is lower than the threshold SNRE, even if the eavesdropper has the ability to use a bitwise MAP decoder. Such codes also achieve high reliability for the friendly parties provided they have an SNR above a second threshold SNRB. It is shown how asymptotically optimized LDPC codes can be designed with differential evolution where the goal is to achieve high reliability between friendly parties and security against a passive eavesdropper while keeping the security gap SNRB/SNRE as small as possible. The proposed coding scheme is applicable at finite block lengths and can be combined with existing cryptographic schemes to deliver improved data security by taking advantage of the stochastic nature of many communication channels.