Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices
Information Theory
2012-05-22 v2 Cryptography and Security
math.IT
Abstract
The aim of this paper is to prove coding theorems for the wiretap channel coding problem and secret key agreement problem based on the the notion of a hash property for an ensemble of functions. These theorems imply that codes using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate universal coding theorems for a wiretap channel and a secret key agreement are also proved.
Keywords
Cite
@article{arxiv.0903.4014,
title = {Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices},
author = {Jun Muramatsu and Shigeki Miyake},
journal= {arXiv preprint arXiv:0903.4014},
year = {2012}
}
Comments
A part of this paper is presented in part at 2009 IEEE Information Theory Workshop (ITW2009), Taormina, Italy, pp.105-109, 2009. This paper is submitted to IEEE Transactions on Information Theory. 34 pages