On multiterminal secrecy capacities

I. Csiszár, Prakash Narayan

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

Abstract

Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source 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, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. 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. The latter partially fills a gap in the authors' previous work [6].

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2051-2055
Number of pages5
DOIs
Publication statusPublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Other

Other2007 IEEE International Symposium on Information Theory, ISIT 2007
CountryFrance
CityNice
Period6/24/076/29/07

Fingerprint

Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Csiszár, I., & Narayan, P. (2007). On multiterminal secrecy capacities. In IEEE International Symposium on Information Theory - Proceedings (pp. 2051-2055). [4557158] https://doi.org/10.1109/ISIT.2007.4557158

On multiterminal secrecy capacities. / Csiszár, I.; Narayan, Prakash.

IEEE International Symposium on Information Theory - Proceedings. 2007. p. 2051-2055 4557158.

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

Csiszár, I & Narayan, P 2007, On multiterminal secrecy capacities. in IEEE International Symposium on Information Theory - Proceedings., 4557158, pp. 2051-2055, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 6/24/07. https://doi.org/10.1109/ISIT.2007.4557158
Csiszár I, Narayan P. On multiterminal secrecy capacities. In IEEE International Symposium on Information Theory - Proceedings. 2007. p. 2051-2055. 4557158 https://doi.org/10.1109/ISIT.2007.4557158
Csiszár, I. ; Narayan, Prakash. / On multiterminal secrecy capacities. IEEE International Symposium on Information Theory - Proceedings. 2007. pp. 2051-2055
@inproceedings{e07014064bd64e0ea1a30ed5da741588,
title = "On multiterminal secrecy capacities",
abstract = "Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source 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, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. 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. The latter partially fills a gap in the authors' previous work [6].",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "2007",
doi = "10.1109/ISIT.2007.4557158",
language = "English",
isbn = "1424414296",
pages = "2051--2055",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - On multiterminal secrecy capacities

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 2007

Y1 - 2007

N2 - Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source 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, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. 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. The latter partially fills a gap in the authors' previous work [6].

AB - Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source 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, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. 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. The latter partially fills a gap in the authors' previous work [6].

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

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

U2 - 10.1109/ISIT.2007.4557158

DO - 10.1109/ISIT.2007.4557158

M3 - Conference contribution

AN - SCOPUS:51649115781

SN - 1424414296

SN - 9781424414291

SP - 2051

EP - 2055

BT - IEEE International Symposium on Information Theory - Proceedings

ER -