TY - GEN
T1 - On Achieving a Positive Rate in the Source Model Key Agreement Problem
AU - Gohari, Amin
AU - Gunlu, Onur
AU - Kramer, Gerhard
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - The two-party key agreement problem with public discussion, known as the source model problem, is considered for an erasure model for Eve's side information. By relating the key agreement problem to hypothesis testing, a new coding scheme is developed that yields an upper bound on the maximum erasure probability for which the secret-key (SK) capacity is zero. The bound is shown to be tight when Alice's or Bob's source is binary, and this shows that the new code achieves larger SK rates than the best known coding scheme. A full version of this paper with extensions to general models for Eve's side information is available in [1].
AB - The two-party key agreement problem with public discussion, known as the source model problem, is considered for an erasure model for Eve's side information. By relating the key agreement problem to hypothesis testing, a new coding scheme is developed that yields an upper bound on the maximum erasure probability for which the secret-key (SK) capacity is zero. The bound is shown to be tight when Alice's or Bob's source is binary, and this shows that the new code achieves larger SK rates than the best known coding scheme. A full version of this paper with extensions to general models for Eve's side information is available in [1].
UR - http://www.scopus.com/inward/record.url?scp=85052469331&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437749
DO - 10.1109/ISIT.2018.8437749
M3 - Conference contribution
AN - SCOPUS:85052469331
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2659
EP - 2663
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -