LDPC Codes for the Gaussian Wiretap Channel

Klinc, Demijan; Ha, Jeongseok; McLaughlin, S.W.; Barros, João; Kwak, Byung-Jae

doi:10.1109/tifs.2011.2134093

Cited by 219 publications

(160 citation statements)

References 20 publications

Supporting

Mentioning

160

Contrasting

Order By: Relevance

“…Since systematic transmission yields large security gaps, in [3,10,11], the use of punctured codes is proposed, by associating the secret bits to punctured bits. As shown in [12][13][14], an alternative solution is to scramble the information bits prior to encoding them.…”

Section: Fig 2 Wire-tap Channel Modelmentioning

confidence: 99%

“…However, previous works in this line of research have mostly been focused on flat AWGN channels. In [3,10,11], it has been shown that an effective way of reducing the security gap consists in using punctured LDPC codes over these channels. On the other hand, the use of punctured codes brings the disadvantage of an increase in the power consumption.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

Baldi

Maturo

Ricciutelli

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

It is known that the error rate can be used as a measure of reliability and security over the wire-tap channel when practical, finite length codes are used for transmission, and the security gap is an error rate based metric able to jointly treat these two aspects. In this paper, we consider several low-density parity-check (LDPC) coded transmissions, which represent the state of the art for transmissions over the wire-tap channel and we assess and compare their security gap performance. We consider two kinds of wire-tap channels: the flat and the fast fading wire-tap channels with additive white Gaussian noise. As a reference, we use the progressive edge growth (PEG) algorithm for the design of unstructured LDPC codes and compare its performance with that of four approaches for designing structured LDPC codes. We analyze both systematic and non-systematic transmissions and show that some structured code design techniques are able to achieve comparable or even better performance than the PEG algorithm over the considered channels, while taking advantage of their simpler encoding and decoding procedures.

show abstract

Section: Fig 2 Wire-tap Channel Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

Baldi

Maturo

Ricciutelli

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…LDPC for the Gaussian wiretap channel was suggested in [23], as well as in [24] to suggest secret sharing schemes. LDPCs were also used to allow strong secrecy over a binary erasure channel in [25].…”

Section: Secret Key Agreement Network and Practical Schemesmentioning

confidence: 99%

Wiretap channel with causal state information and secure rate-limited feedback

Cohen

2013

2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and the legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate R f .We derive upper and lower bounds on the secrecy capacity and show that, when the channel to the eavesdropper is degraded, the bounds are tight and the secrecy capacity is completely characterised.The capacity achieving scheme is based on Wyner, Csiszár and Körner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. The upper bound is more involved and requires a non-trivial recursive lemma extending previous results in the literature to include both state and feedback. We conclude the paper by showing that a few interesting known results can be seen as special cases of the above, especially the case where the state information is available only at the decoder, and the suggested scheme achieves the secrecy capacity without a source of randomness at the decoder.

show abstract

“…In this context, an important parameter is the difference between the qualities of the main and eavesdropper's channels (dubbed as security gap) needed for achieving physical layer security [7]. Small security gaps are desirable because they make physical layer security achievable even with a small degradation of the eavesdropper's channel with respect to the main one.…”

Section: Introductionmentioning

confidence: 99%

“…Specifically, punctured LDPC codes are exploited for physical layer security in [7]. Furthermore, [8] demonstrates that using nonsystematic codes obtained from scrambling information bits of a systematic code are quite effective to reduce the security gap, while [9] applies different techniques including scrambling, concatenation, and hybrid automatic repeat-request to LDPC and BCH codes in order to further reduce the security gap.…”

Section: Introductionmentioning

confidence: 99%

Randomized Convolutional Codes for the Wiretap Channel

Nooraiepour¹,

Duman²

2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-We study application of convolutional codes to the randomized encoding scheme introduced by Wyner as a way of confusing the eavesdropper over a wiretap channel. We describe optimal and practical sub-optimal decoders for the main and the eavesdropper's channels, and estimate the security gap, which is used as the main metric. The sub-optimal decoder works based on the trellis of the code generated by a convolutional code and its dual, where one encodes the data bits and the other encodes the random bits. By developing a code design metric, we describe how these two generators should be selected for optimal performance over a Gaussian wiretap channel. We also propose application of serially concatenated convolutional codes to this setup so as to reduce the resulting security gaps. Furthermore, we provide an analytical characterization of the system performance by extending existing lower and upper bounds for coded systems to the current randomized convolutional coding scenario. We illustrate our findings via extensive simulations and numerical examples, which show that the newly proposed coding scheme can outperform the other existing methods in the literature in terms of security gap.

show abstract

LDPC Codes for the Gaussian Wiretap Channel

Cited by 219 publications

References 20 publications

Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

Wiretap channel with causal state information and secure rate-limited feedback

Randomized Convolutional Codes for the Wiretap Channel

Contact Info

Product

Resources

About