Secrecy capacities for multiterminal channel models

I. Csiszár, Prakash Narayan

Research output: Contribution to journalArticle

105 Citations (Scopus)

Abstract

Shannon-theoretic secret key generation by several parties is considered for models in which a secure noisy channel with one input terminal and multiple output terminals and a public noiseless channel of unlimited capacity are available for accomplishing this goal. The secret key is generated for a set A of terminals of the noisy channel, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained for models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. These capacities are shown to be achievable with noninteractive public communication, the channel input terminal sending no public message and each output terminal sending at most one public message, not using randomization. Moreover, when the input terminal belongs to the set A, it can generate the secret key at the outset and transmit it over the noisy channel, suitably encoded, whereupon the output terminals in A securely recover this key using public communication as above. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given.

Original languageEnglish
Pages (from-to)2437-2452
Number of pages16
JournalIEEE Transactions on Information Theory
Volume54
Issue number6
DOIs
Publication statusPublished - Jun 2008

Fingerprint

public communications
secrecy
Communication

Keywords

  • Multiple source
  • Multiterminal channel
  • Private key
  • Secrecy capacity
  • Secret key
  • Wiretap side information

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

Secrecy capacities for multiterminal channel models. / Csiszár, I.; Narayan, Prakash.

In: IEEE Transactions on Information Theory, Vol. 54, No. 6, 06.2008, p. 2437-2452.

Research output: Contribution to journalArticle

Csiszár, I. ; Narayan, Prakash. / Secrecy capacities for multiterminal channel models. In: IEEE Transactions on Information Theory. 2008 ; Vol. 54, No. 6. pp. 2437-2452.
@article{0038cff53a6846ffa010249d26f60ea5,
title = "Secrecy capacities for multiterminal channel models",
abstract = "Shannon-theoretic secret key generation by several parties is considered for models in which a secure noisy channel with one input terminal and multiple output terminals and a public noiseless channel of unlimited capacity are available for accomplishing this goal. The secret key is generated for a set A of terminals of the noisy channel, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained for models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. These capacities are shown to be achievable with noninteractive public communication, the channel input terminal sending no public message and each output terminal sending at most one public message, not using randomization. Moreover, when the input terminal belongs to the set A, it can generate the secret key at the outset and transmit it over the noisy channel, suitably encoded, whereupon the output terminals in A securely recover this key using public communication as above. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given.",
keywords = "Multiple source, Multiterminal channel, Private key, Secrecy capacity, Secret key, Wiretap side information",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "2008",
month = "6",
doi = "10.1109/TIT.2008.921705",
language = "English",
volume = "54",
pages = "2437--2452",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Secrecy capacities for multiterminal channel models

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 2008/6

Y1 - 2008/6

N2 - Shannon-theoretic secret key generation by several parties is considered for models in which a secure noisy channel with one input terminal and multiple output terminals and a public noiseless channel of unlimited capacity are available for accomplishing this goal. The secret key is generated for a set A of terminals of the noisy channel, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained for models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. These capacities are shown to be achievable with noninteractive public communication, the channel input terminal sending no public message and each output terminal sending at most one public message, not using randomization. Moreover, when the input terminal belongs to the set A, it can generate the secret key at the outset and transmit it over the noisy channel, suitably encoded, whereupon the output terminals in A securely recover this key using public communication as above. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given.

AB - Shannon-theoretic secret key generation by several parties is considered for models in which a secure noisy channel with one input terminal and multiple output terminals and a public noiseless channel of unlimited capacity are available for accomplishing this goal. The secret key is generated for a set A of terminals of the noisy channel, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained for models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. These capacities are shown to be achievable with noninteractive public communication, the channel input terminal sending no public message and each output terminal sending at most one public message, not using randomization. Moreover, when the input terminal belongs to the set A, it can generate the secret key at the outset and transmit it over the noisy channel, suitably encoded, whereupon the output terminals in A securely recover this key using public communication as above. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given.

KW - Multiple source

KW - Multiterminal channel

KW - Private key

KW - Secrecy capacity

KW - Secret key

KW - Wiretap side information

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

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

U2 - 10.1109/TIT.2008.921705

DO - 10.1109/TIT.2008.921705

M3 - Article

VL - 54

SP - 2437

EP - 2452

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -