Proceedings ArticleDOI
LDPC codes for the Gaussian wiretap channel
Demijan Kline,Jeongseok Ha,Steven W. McLaughlin,Joao Barros,Byung-Jae Kwak +4 more
- pp 95-99
TLDR
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 as small as possible.Abstract:
A coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes is presented. The messages are transmitted over punctured bits to hide data from eavesdroppers. It is shown by means of density evolution that the BER of an eavesdropper, who operates below the code's SNR threshold and has the ability to use a bitwise MAP decoder, increases to 0.5 within a few dB. 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 as small as possible. The proposed coding scheme is also efficiently encodable in almost linear time.read more
Citations
More filters
Book
Information Theoretic Security
TL;DR: Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems to achieve secrecy for a basic wire-tap channel model as well as for its extensions to multiuser networks.
Journal ArticleDOI
LDPC Codes for the Gaussian Wiretap Channel
TL;DR: This paper presents a coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes that is encodable in linear time, 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.
Journal ArticleDOI
Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis
TL;DR: While Eve's channel has a quality equal to or better than that of Bob's channel, it is shown that the use of a hybrid automatic repeat-request protocol with authentication still allows achieving a sufficient level of security.
Journal ArticleDOI
Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis
TL;DR: This work considers the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise channel, while Eve is eavesdropping, also through an AWGN channel, and proposes a coding strategy based on lattice coset encoding.
Journal ArticleDOI
Secure Multiterminal Source Coding With Side Information at the Eavesdropper
Joffrey Villard,Pablo Piantanida +1 more
TL;DR: Inner and outer bounds on the so-called rate-distortion-equivocation region are derived and optimal coding schemes are characterized for some cases of interest where the statistical differences between the side information at the decoders and the presence of a nonzero distortion at Bob can be fully exploited to guarantee secrecy.
References
More filters
Journal ArticleDOI
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Journal ArticleDOI
Communication theory of secrecy systems
TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
Journal ArticleDOI
The wire-tap channel
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
Journal ArticleDOI
Broadcast channels with confidential messages
Imre Csiszár,János Körner +1 more
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.