DocumentCode
2976364
Title
Robust key agreement schemes
Author
Chan, Terence ; Ning Cai ; Grant, Alex
Author_Institution
Inst. for Telecommun. Res., Univ. of South Australia, Adelaide, SA, Australia
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
2106
Lastpage
2110
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.
Keywords
cryptography; adversarial tampering; adversary; coding scheme; key agreement problem; key agreement process; maximum key generation rate; message exchanging; robust key agreement scheme; secrecy constraint; Authentication; Collaboration; Cryptography; Data communication; Hamming distance; Protection; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205259
Filename
5205259
Link To Document