Secure rate-adaptive reconciliation
Information Theory
2011-06-07 v2 math.IT
Abstract
We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion with the secret key agreement model introduced by Ahlswede and Csisz\'ar, the channel-type model with wiretapper, we study a protocol based on error correcting codes. The protocol can be adapted to changes in the communication channel extending the original source. The efficiency of the reconciliation is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice's and Bob's sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.
Keywords
Cite
@article{arxiv.1007.0904,
title = {Secure rate-adaptive reconciliation},
author = {David Elkouss and Jesus Martinez-Mateo and Vicente Martin},
journal= {arXiv preprint arXiv:1007.0904},
year = {2011}
}
Comments
6 pages, 5 figures