Robust Key Agreement Schemes
Information Theory
2009-01-30 v1 math.IT
Abstract
This paper considers a key agreement problem in which two parties aim to agree on a key by exchanging messages in the presence of adversarial tampering. The aim of the adversary is to disrupt the key agreement process, but there are no secrecy constraints (i.e. we do not insist that the key is kept secret from the adversary). The main results of the paper are coding schemes and bounds on maximum key generation rates for this problem.
Cite
@article{arxiv.0901.4551,
title = {Robust Key Agreement Schemes},
author = {Terence Chan and Ning Cai and Alex Grant},
journal= {arXiv preprint arXiv:0901.4551},
year = {2009}
}