On Achieving a Positive Rate in the Source Model Key Agreement Problem

Amin Gohari, Onur Gunlu, Gerhard Kramer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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].

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2659-2663
Number of pages5
ISBN (Print)9781538647806
DOIs
StatePublished - 15 Aug 2018
Externally publishedYes
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: 17 Jun 201822 Jun 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-June
ISSN (Print)2157-8095

Conference

Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/TerritoryUnited States
CityVail
Period17/06/1822/06/18

Fingerprint

Dive into the research topics of 'On Achieving a Positive Rate in the Source Model Key Agreement Problem'. Together they form a unique fingerprint.

Cite this