Secret-Key capacity of compound source models with one-way public communication

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

4 Scopus citations

Abstract

In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this work, the Secret-Key generation model based on a compound source is studied where the source realization is unknown. The protocol should guarantee the security and reliability of the generated Secret-Key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the Secret-Key capacity is derived for the case where the public communication rate is limited. Furthermore, a multi-letter capacity formula is computed for the case where the public communication is unconstrained.

Original languageEnglish
Title of host publicationITW 2015 - 2015 IEEE Information Theory Workshop
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages252-256
Number of pages5
ISBN (Electronic)9781467378529
DOIs
StatePublished - 17 Dec 2015
EventIEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of
Duration: 11 Oct 201515 Oct 2015

Publication series

NameITW 2015 - 2015 IEEE Information Theory Workshop

Conference

ConferenceIEEE Information Theory Workshop, ITW 2015
Country/TerritoryKorea, Republic of
CityJeju Island
Period11/10/1515/10/15

Fingerprint

Dive into the research topics of 'Secret-Key capacity of compound source models with one-way public communication'. Together they form a unique fingerprint.

Cite this