Efficient reconciliation protocol for discrete-variable quantum key distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Iterative decoding of binary block and convolutional codes
IEEE Transactions on Information Theory
Gradient of mutual information in linear vector Gaussian channels
IEEE Transactions on Information Theory
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory
On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes
IEEE Transactions on Information Theory
LDPC Codes for the Gaussian Wiretap Channel
IEEE Transactions on Information Forensics and Security - Part 1
Secret-Sharing LDPC Codes for the BPSK-Constrained Gaussian Wiretap Channel
IEEE Transactions on Information Forensics and Security - Part 1
| Hi-index | 0.00 |
Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.