Robust Key Agreement Schemes

Simple item page
dc.creatorChan, Terence
dc.creatorCai, Ning
dc.creatorGrant, Alex
dc.date2009-01-29
dc.date.accessioned2026-07-07T12:35:31Z
dc.date.available2026-07-07T12:35:31Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/0901.4551
dc.identifierhttp://arxiv.org/abs/0901.4551
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217788
dc.subjectInformation Theory
dc.titleRobust Key Agreement Schemes
dc.typetext

Files

Collections

arXiv