Common randomness and secret key generation with a helper

I. Csiszár, Prakash Narayan

Research output: Article

186 Citations (Scopus)

Abstract

We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a `helper' terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.

Original languageEnglish
Pages (from-to)344-366
Number of pages23
JournalIEEE Transactions on Information Theory
Volume46
Issue number2
DOIs
Publication statusPublished - 2000

Fingerprint

helper
secrecy

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

Common randomness and secret key generation with a helper. / Csiszár, I.; Narayan, Prakash.

In: IEEE Transactions on Information Theory, Vol. 46, No. 2, 2000, p. 344-366.

Research output: Article

@article{1ac3dedcf6b94fb1a96d490bd3989176,
title = "Common randomness and secret key generation with a helper",
abstract = "We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a `helper' terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "2000",
doi = "10.1109/18.825796",
language = "English",
volume = "46",
pages = "344--366",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Common randomness and secret key generation with a helper

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 2000

Y1 - 2000

N2 - We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a `helper' terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.

AB - We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a `helper' terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.

UR - http://www.scopus.com/inward/record.url?scp=0033891095&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033891095&partnerID=8YFLogxK

U2 - 10.1109/18.825796

DO - 10.1109/18.825796

M3 - Article

AN - SCOPUS:0033891095

VL - 46

SP - 344

EP - 366

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -