# Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes

@article{Subramanian2011StrongSO,
title={Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes},
author={A Subramanian and Andrew Thangaraj and Matthieu R. Bloch and Steven W. McLaughlin},
journal={IEEE Transactions on Information Forensics and Security},
year={2011},
volume={6},
pages={585-594}
}
• A. Subramanian, +1 author S. McLaughlin
• Published 16 September 2010
• Mathematics, Computer Science
• IEEE Transactions on Information Forensics and Security
For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel with erasure probability ϵ, decays as <i>O</i>(exp(-(<i>c</i><sub>1</sub>)<i>n(c</i><sub>2</sub…

## Figures and Topics from this paper

Perfect Secrecy Over Binary Erasure Wiretap Channel of Type II
• Mathematics, Computer Science
IEEE Transactions on Information Forensics and Security
• 2012
A secret key agreement scheme that adopts the formulation S = HX of Wyner-Ozarows's linear coset coding and achieves perfect secrecy over a binary erasure wiretap channel of type II in which the number of eavesdropped bits μ becomes available a posteriori.
Deterministic constructions for large girth protograph LDPC codes
• Mathematics, Computer Science
2013 IEEE International Symposium on Information Theory
• 2013
This paper analyzes density evolution for protograph LDPC codes over the binary erasure channel and shows that their bit-error probability decreases double exponentially with the number of iterations when the erasure probability is below the bit- Error threshold, resulting in an exponential fall in bit- error probability below the threshold.
An LDPC Code Based Physical Layer Message Authentication Scheme With Prefect Security
An efficient and feasible authentication scheme based on low-density parity-check (LDPC) codes andinline-formula and lightweight hash functions over binary-input wiretap channel is proposed and theoretically proves that, the proposed schemes are perfect secure if the number of attacks from Eve is upper bounded by a polynomial times.
Performance Analysis of Transmission over AWGN Wiretap Channels with Practical Codes
• Computer Science
• 2016
This chapter analyzes the performance of practical codes over the Gaussian wiretap channel by using suitable metrics which take into account the codeword length and even the specific code structure, and focuses on low-density parity-check codes as they are among the most viable candidates for the use in this setting.
Node-splitting constructions for large girth irregular and protograph LDPC codes
• Mathematics, Computer Science
2014 Twentieth National Conference on Communications (NCC)
• 2014
Simulations, over a binary erasure channel, confirm the gains in block-error rate obtained by the large girth construction and show code constructions with smaller block length for the same girth, when compared to previous constructions.
Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2019
Efficient encoding and decoding algorithms are proposed for multilevel binary low-density parity-check (LDPC) lattices constructed via Construction, which relaxes some of the nesting constraints on the parity- check matrices of the component codes, leading to a simpler and improved design.
BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification
• Mathematics, Computer Science
IEEE Transactions on Communications
• 2016
A bit-error-rate (BER)-based physical layer security approach is proposed for the finite blocklengths for the discrete memoryless channels and the concept is extended to other DMCs including the binary symmetric channels and binary erasure channels.
Analysis of short blocklength codes for secrecy
• Computer Science, Mathematics
EURASIP J. Wirel. Commun. Netw.
• 2018
In this paper, we provide secrecy metrics applicable to physical-layer coding techniques with finite blocklengths over Gaussian and fading wiretap channel models and analyze their secrecy performance
Secure Coding for the Gaussian Wiretap Channel with Sparse Regression Codes
• Manos Athanasakos
• Computer Science
2021 55th Annual Conference on Information Sciences and Systems (CISS)
• 2021
The Gaussian wiretap channel (WTC), where two legitimate users communicate in the presence of a passive eavesdropper, is considered and the nested structure that exhibit and a coding scheme which achieves a level of information-theoretic security and reliability simultaneously is proposed.
Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming
• Mathematics, Computer Science
2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters - no degradation or symmetry assumptions are made on the channel. Our main

## References

SHOWING 1-10 OF 47 REFERENCES
Strong secrecy for erasure wiretap channels
• Mathematics, Computer Science
2010 IEEE Information Theory Workshop
• 2010
It is shown that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC) of erasure probability greater than 1–∊<inf>ef</inf>.
Stopping set distribution of LDPC code ensembles
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2005
Several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles are derived, including an expression for the normalized average stopping set distribution, yielding a critical fraction of the block length above which codes have exponentially many stopping sets of that size.
Exchange of Limits: Why Iterative Decoding Works
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2011
It is shown that as long as the message reliabilities are bounded and other technical conditions are met, the bit error probability vanishes up to a nontrivial threshold regardless of how the limit is taken.
Applications of LDPC Codes to the Wiretap Channel
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2007
This correspondence provides an alternative view of the proof for secrecy capacity of wire tap channels and shows how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel, and shows that it is possible to construct linear-time decodable secrecy codes based on low-density parity-check codes that achieve secrecy.
Explicit construction of families of LDPC codes with no 4-cycles
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2004
It is proved that for an odd prime p, LU(3,p) is a [p/sup 3/,k] code with k/spl ges/(p/Sup 3/-2p/ Sup 2/+3p-2)/2, and it is shown that the minimum weight and the weight of the minimum stopping set of LU (3,q) are at least 2q and they are exactly 2q for many LU( 3,q).
Performance Analysis and Design of Two Edge-Type LDPC Codes for the BEC Wiretap Channel
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2013
A code construction method using two edge-type low-density parity-check (LDPC) codes based on the coset encoding scheme is proposed, and it is found that relatively simple constructions give very good secrecy performance.
Capacity-achieving sequences for the erasure channel
• Mathematics, Computer Science
IEEE Trans. Inf. Theory
• 2002
It turns out that the right-regular sequence is c.a. in a much stronger sense than, e.g., the Tornado sequence, which explains why numerical optimization techniques tend to favor graphs with only one degree of check nodes.
Low-density parity-check codes
• R. Gallager
• Mathematics, Computer Science
IRE Trans. Inf. Theory
• 1962
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.
An analysis of the block error probability performance of iterative decoding
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2005
It is proved that there exist codes in Gallager's regular low-density parity-check codes, Tanner's generalized LDPC codes, and the turbo codes due to Berrou et al. for which the block length of the codes N and the number of iterations I go to infinity goes to zero.
A Combinatorial Family of Near Regular LDPC Codes
• Mathematics, Computer Science
2007 IEEE International Symposium on Information Theory
• 2007
An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented and it is demonstrated that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.