Wiretap channels form the most basic building block of physical-layer and information-theoretic security. Considerable research work has gone into the information-theoretic, cryptographic and coding aspects of wiretap channels in the last few years. The main goal of this tutorial article is to provide a self-contained presentation of two recent results - one is a new and simplified proof for secrecy capacity using channel resolvability, and the other is the connection between semantic security and information-theoretic strong secrecy. © 2014 IEEE.

Andrew Edwin Thangaraj

Department of Electrical Engineering

Information theory

Mobile security

Network layers

Semantics

basic building block

Information- theoretic securities

Physical layers

SEMANTIC SECURITY

STRONG SECRECIES

WIRE-TAP CHANNELS

Security of data

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

Coding for wiretap channels: Channel resolvability and semantic security

2014 IEEE Information Theory Workshop, ITW 2014

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 O(exp (-c 1nc2)) with the block-length n for positive constants c1 and c2 , as long as ε is less than the erasure threshold εth of the DDP. This guarantees that the coset coding scheme using the dual sequence provides strong secrecy over the binary erasure wiretap channel for erasure probabilities greater than 1-εth. © 2011 IEEE.

Fulltext

IEEE Transactions on Information Forensics and Security

Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes

Journal	Data powered by Typeset2014 IEEE Information Theory Workshop, ITW 2014
Publisher	Data powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
Open Access	No