Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices

Authors:
Jun Muramatsu
Affiliations:
The author is with the NTT Communication Science Laboratories, NTT Corporation, Kyoto-shi, 619--0237 Japan. E-mail: pure@cslab.kecl.ntt.co.jp
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2006

Citing 0
Cited 5

Information Theoretic Security

Foundations and Trends in Communications and Information Theory
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Coding theorem for general stationary memoryless channel based on hash property

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Hash property and coding theorems for sparse matrices and maximum-likelihood coding

IEEE Transactions on Information Theory
Hash property and fixed-rate universal coding theorems

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.12

Visualization

Abstract

This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from correlated random numbers are also discussed.