Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel

Manik Raina; Ruoheng Liu; Predrag Spasojević; H. Vincent Poor

doi:10.1109/ITWKSPS.2010.5503169

Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel

Manik Raina, Ruoheng Liu, Predrag Spasojević, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

This paper studies the problem of secrecy coding for the type-II binary symmetric memoryless wiretap channel. In this model, the main channel is binary-input and noiseless and the eavesdropper channel is binary-symmetric memoryless. A coding strategy based on secure nested codes is proposed. A capacity achieving length-n code for the eavesdropper channel bins the space {0, 1}ⁿ into co-sets which are used for secret messaging. The resulting co-set scheme achieves secrecy capacity of the type-II binary symmetric memoryless channel. As an example, the ensemble of capacity-achieving regular low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes is studied as a basis for binning.

Original language	English (US)
Title of host publication	IEEE Information Theory Workshop 2010, ITW 2010
DOIs	https://doi.org/10.1109/ITWKSPS.2010.5503169
State	Published - 2010
Externally published	Yes
Event	IEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt Duration: Jan 6 2010 → Jan 8 2010

Publication series

Name	IEEE Information Theory Workshop 2010, ITW 2010

Other

Other	IEEE Information Theory Workshop 2010, ITW 2010
Country/Territory	Egypt
City	Cairo
Period	1/6/10 → 1/8/10

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Theoretical Computer Science

Access to Document

10.1109/ITWKSPS.2010.5503169

Cite this

@inproceedings{d9580f2f5a924b53b0b0683eb02f5dcb,

title = "Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel",

abstract = "This paper studies the problem of secrecy coding for the type-II binary symmetric memoryless wiretap channel. In this model, the main channel is binary-input and noiseless and the eavesdropper channel is binary-symmetric memoryless. A coding strategy based on secure nested codes is proposed. A capacity achieving length-n code for the eavesdropper channel bins the space {0, 1}n into co-sets which are used for secret messaging. The resulting co-set scheme achieves secrecy capacity of the type-II binary symmetric memoryless channel. As an example, the ensemble of capacity-achieving regular low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes is studied as a basis for binning.",

author = "Manik Raina and Ruoheng Liu and Predrag Spasojevi{\'c} and Poor, {H. Vincent}",

year = "2010",

doi = "10.1109/ITWKSPS.2010.5503169",

language = "English (US)",

isbn = "9781424463725",

series = "IEEE Information Theory Workshop 2010, ITW 2010",

booktitle = "IEEE Information Theory Workshop 2010, ITW 2010",

note = "IEEE Information Theory Workshop 2010, ITW 2010 ; Conference date: 06-01-2010 Through 08-01-2010",

}

Raina, M, Liu, R, Spasojević, P & Poor, HV 2010, Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel. in IEEE Information Theory Workshop 2010, ITW 2010., 5503169, IEEE Information Theory Workshop 2010, ITW 2010, IEEE Information Theory Workshop 2010, ITW 2010, Cairo, Egypt, 1/6/10. https://doi.org/10.1109/ITWKSPS.2010.5503169

TY - GEN

T1 - Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel

AU - Raina, Manik

AU - Liu, Ruoheng

AU - Spasojević, Predrag

AU - Poor, H. Vincent

PY - 2010

Y1 - 2010

N2 - This paper studies the problem of secrecy coding for the type-II binary symmetric memoryless wiretap channel. In this model, the main channel is binary-input and noiseless and the eavesdropper channel is binary-symmetric memoryless. A coding strategy based on secure nested codes is proposed. A capacity achieving length-n code for the eavesdropper channel bins the space {0, 1}n into co-sets which are used for secret messaging. The resulting co-set scheme achieves secrecy capacity of the type-II binary symmetric memoryless channel. As an example, the ensemble of capacity-achieving regular low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes is studied as a basis for binning.

AB - This paper studies the problem of secrecy coding for the type-II binary symmetric memoryless wiretap channel. In this model, the main channel is binary-input and noiseless and the eavesdropper channel is binary-symmetric memoryless. A coding strategy based on secure nested codes is proposed. A capacity achieving length-n code for the eavesdropper channel bins the space {0, 1}n into co-sets which are used for secret messaging. The resulting co-set scheme achieves secrecy capacity of the type-II binary symmetric memoryless channel. As an example, the ensemble of capacity-achieving regular low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes is studied as a basis for binning.

UR - http://www.scopus.com/inward/record.url?scp=77954826101&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954826101&partnerID=8YFLogxK

U2 - 10.1109/ITWKSPS.2010.5503169

DO - 10.1109/ITWKSPS.2010.5503169

M3 - Conference contribution

AN - SCOPUS:77954826101

SN - 9781424463725

T3 - IEEE Information Theory Workshop 2010, ITW 2010

BT - IEEE Information Theory Workshop 2010, ITW 2010

T2 - IEEE Information Theory Workshop 2010, ITW 2010

Y2 - 6 January 2010 through 8 January 2010

ER -

Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this