Multiterminal secrecy capacities

I. Csiszár, Prakash Narayan

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

Abstract

Shannon-theoretic secrecy 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 Secrecy is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained when secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. We show that secrecy capacity can be achieved with non-interactive communication. For source models, the key can be generated by any chosen terminal in the secrecy-seeking set A of terminals obliviously of the public communication. For channel models, secrecy capacity can be achieved with the 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 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. When 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. This paper is a compilation of selected prior results from [6], [7], [8].

Original languageEnglish
Title of host publication45th Annual Allerton Conference on Communication, Control, and Computing 2007
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages144-149
Number of pages6
Volume1
ISBN (Print)9781605600864
Publication statusPublished - 2007
Event45th Annual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States
Duration: Sep 26 2007Sep 28 2007

Other

Other45th Annual Allerton Conference on Communication, Control, and Computing 2007
CountryUnited States
CityMonticello
Period9/26/079/28/07

Fingerprint

Communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Csiszár, I., & Narayan, P. (2007). Multiterminal secrecy capacities. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007 (Vol. 1, pp. 144-149). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

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

45th Annual Allerton Conference on Communication, Control, and Computing 2007. Vol. 1 University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2007. p. 144-149.

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

Csiszár, I & Narayan, P 2007, Multiterminal secrecy capacities. in 45th Annual Allerton Conference on Communication, Control, and Computing 2007. vol. 1, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 144-149, 45th Annual Allerton Conference on Communication, Control, and Computing 2007, Monticello, United States, 9/26/07.
Csiszár I, Narayan P. Multiterminal secrecy capacities. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007. Vol. 1. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2007. p. 144-149
Csiszár, I. ; Narayan, Prakash. / Multiterminal secrecy capacities. 45th Annual Allerton Conference on Communication, Control, and Computing 2007. Vol. 1 University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2007. pp. 144-149
@inproceedings{41f49a8ed28941168c2ae4b9026bae5a,
title = "Multiterminal secrecy capacities",
abstract = "Shannon-theoretic secrecy 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 Secrecy is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained when secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. We show that secrecy capacity can be achieved with non-interactive communication. For source models, the key can be generated by any chosen terminal in the secrecy-seeking set A of terminals obliviously of the public communication. For channel models, secrecy capacity can be achieved with the 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 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. When 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. This paper is a compilation of selected prior results from [6], [7], [8].",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "2007",
language = "English",
isbn = "9781605600864",
volume = "1",
pages = "144--149",
booktitle = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",
publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

}

TY - GEN

T1 - Multiterminal secrecy capacities

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 2007

Y1 - 2007

N2 - Shannon-theoretic secrecy 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 Secrecy is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained when secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. We show that secrecy capacity can be achieved with non-interactive communication. For source models, the key can be generated by any chosen terminal in the secrecy-seeking set A of terminals obliviously of the public communication. For channel models, secrecy capacity can be achieved with the 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 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. When 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. This paper is a compilation of selected prior results from [6], [7], [8].

AB - Shannon-theoretic secrecy 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 Secrecy is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained when secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. We show that secrecy capacity can be achieved with non-interactive communication. For source models, the key can be generated by any chosen terminal in the secrecy-seeking set A of terminals obliviously of the public communication. For channel models, secrecy capacity can be achieved with the 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 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. When 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. This paper is a compilation of selected prior results from [6], [7], [8].

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

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

M3 - Conference contribution

AN - SCOPUS:84940639399

SN - 9781605600864

VL - 1

SP - 144

EP - 149

BT - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

ER -