Secrecy capacities for multiterminal channel models

I. Csiszár, Prakash Narayan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We derive single-letter characterizations of (strong) secrecy capacities for models in which a "helper" terminal is connected to an arbitrary number of "user" terminals by a discrete memoryless channel (DMC). The helper terminal governs the input of the DMC, over which it transmits to the user terminals that observe the corresponding outputs; transmissions over the DMC are secure. Additionally, following each transmission over the DMC, unrestricted and interactive public communication is permitted between all the terminals. A subset of the user terminals, and possibly the helper terminal, generate secrecy with the remaining user terminals acting as abettors. We distinguish between the cases in which the helper terminal may, or may not, randomize. Two kinds of secrecy capacity are considered, depending on the extent of an eavesdropper's knowledge: secret key (SK) and private key (PK) capacity. These secrecy capacities are shown to be achievable with noninteractive communication between the terminals and with no public transmission from the helper terminal. When the helper terminal is forbidden to randomize, the needed transmission over the DMC entails only that of a constant sequence. It is also shown that additional randomization at the user terminals does not serve to enhance the secrecy capacities.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2138-2141
Number of pages4
Volume2005
DOIs
Publication statusPublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

Other

Other2005 IEEE International Symposium on Information Theory, ISIT 05
CountryAustralia
CityAdelaide
Period9/4/059/9/05

Fingerprint

Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Csiszár, I., & Narayan, P. (2005). Secrecy capacities for multiterminal channel models. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2005, pp. 2138-2141). [1523724] https://doi.org/10.1109/ISIT.2005.1523724

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

IEEE International Symposium on Information Theory - Proceedings. Vol. 2005 2005. p. 2138-2141 1523724.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Csiszár, I & Narayan, P 2005, Secrecy capacities for multiterminal channel models. in IEEE International Symposium on Information Theory - Proceedings. vol. 2005, 1523724, pp. 2138-2141, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australia, 9/4/05. https://doi.org/10.1109/ISIT.2005.1523724
Csiszár I, Narayan P. Secrecy capacities for multiterminal channel models. In IEEE International Symposium on Information Theory - Proceedings. Vol. 2005. 2005. p. 2138-2141. 1523724 https://doi.org/10.1109/ISIT.2005.1523724
Csiszár, I. ; Narayan, Prakash. / Secrecy capacities for multiterminal channel models. IEEE International Symposium on Information Theory - Proceedings. Vol. 2005 2005. pp. 2138-2141
@inproceedings{427a0e5768cb4b39b6654b8001eed82c,
title = "Secrecy capacities for multiterminal channel models",
abstract = "We derive single-letter characterizations of (strong) secrecy capacities for models in which a {"}helper{"} terminal is connected to an arbitrary number of {"}user{"} terminals by a discrete memoryless channel (DMC). The helper terminal governs the input of the DMC, over which it transmits to the user terminals that observe the corresponding outputs; transmissions over the DMC are secure. Additionally, following each transmission over the DMC, unrestricted and interactive public communication is permitted between all the terminals. A subset of the user terminals, and possibly the helper terminal, generate secrecy with the remaining user terminals acting as abettors. We distinguish between the cases in which the helper terminal may, or may not, randomize. Two kinds of secrecy capacity are considered, depending on the extent of an eavesdropper's knowledge: secret key (SK) and private key (PK) capacity. These secrecy capacities are shown to be achievable with noninteractive communication between the terminals and with no public transmission from the helper terminal. When the helper terminal is forbidden to randomize, the needed transmission over the DMC entails only that of a constant sequence. It is also shown that additional randomization at the user terminals does not serve to enhance the secrecy capacities.",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "2005",
doi = "10.1109/ISIT.2005.1523724",
language = "English",
isbn = "0780391519",
volume = "2005",
pages = "2138--2141",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Secrecy capacities for multiterminal channel models

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 2005

Y1 - 2005

N2 - We derive single-letter characterizations of (strong) secrecy capacities for models in which a "helper" terminal is connected to an arbitrary number of "user" terminals by a discrete memoryless channel (DMC). The helper terminal governs the input of the DMC, over which it transmits to the user terminals that observe the corresponding outputs; transmissions over the DMC are secure. Additionally, following each transmission over the DMC, unrestricted and interactive public communication is permitted between all the terminals. A subset of the user terminals, and possibly the helper terminal, generate secrecy with the remaining user terminals acting as abettors. We distinguish between the cases in which the helper terminal may, or may not, randomize. Two kinds of secrecy capacity are considered, depending on the extent of an eavesdropper's knowledge: secret key (SK) and private key (PK) capacity. These secrecy capacities are shown to be achievable with noninteractive communication between the terminals and with no public transmission from the helper terminal. When the helper terminal is forbidden to randomize, the needed transmission over the DMC entails only that of a constant sequence. It is also shown that additional randomization at the user terminals does not serve to enhance the secrecy capacities.

AB - We derive single-letter characterizations of (strong) secrecy capacities for models in which a "helper" terminal is connected to an arbitrary number of "user" terminals by a discrete memoryless channel (DMC). The helper terminal governs the input of the DMC, over which it transmits to the user terminals that observe the corresponding outputs; transmissions over the DMC are secure. Additionally, following each transmission over the DMC, unrestricted and interactive public communication is permitted between all the terminals. A subset of the user terminals, and possibly the helper terminal, generate secrecy with the remaining user terminals acting as abettors. We distinguish between the cases in which the helper terminal may, or may not, randomize. Two kinds of secrecy capacity are considered, depending on the extent of an eavesdropper's knowledge: secret key (SK) and private key (PK) capacity. These secrecy capacities are shown to be achievable with noninteractive communication between the terminals and with no public transmission from the helper terminal. When the helper terminal is forbidden to randomize, the needed transmission over the DMC entails only that of a constant sequence. It is also shown that additional randomization at the user terminals does not serve to enhance the secrecy capacities.

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

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

U2 - 10.1109/ISIT.2005.1523724

DO - 10.1109/ISIT.2005.1523724

M3 - Conference contribution

AN - SCOPUS:33749441153

SN - 0780391519

SN - 9780780391512

VL - 2005

SP - 2138

EP - 2141

BT - IEEE International Symposium on Information Theory - Proceedings

ER -