Secrecy generation for multiple input multiple output channel models

I. Csiszár, Prakash Narayan

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

11 Citations (Scopus)

Abstract

Shannon theoretic secret key generation by several parties is considered for models in which a secure noisy channel with multiple input and 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 lower and upper bounds for 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. These bounds coincide in special cases, and the lower bounds are not tight in general. We also consider models in which different sets of terminals share multiple keys, one forterminals in each set with secrecy required from the eavesdropper as well as the remaining terminals in the other sets. Partial results include showing links among the associated secrecy capacity region for multiple keys, the transmission capacity region of the multiple access channel defined by the secure noisy channel, and achievable rates for a single secret key for all the terminals.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2447-2451
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint

Channel Model
Multiple-input multiple-output (MIMO)
Communication
Multiple Access Channel
Upper and Lower Bounds
Disjoint
Lower bound
Partial
Output
Model

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Csiszár, I., & Narayan, P. (2009). Secrecy generation for multiple input multiple output channel models. In IEEE International Symposium on Information Theory - Proceedings (pp. 2447-2451). [5206054] https://doi.org/10.1109/ISIT.2009.5206054

Secrecy generation for multiple input multiple output channel models. / Csiszár, I.; Narayan, Prakash.

IEEE International Symposium on Information Theory - Proceedings. 2009. p. 2447-2451 5206054.

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

Csiszár, I & Narayan, P 2009, Secrecy generation for multiple input multiple output channel models. in IEEE International Symposium on Information Theory - Proceedings., 5206054, pp. 2447-2451, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5206054
Csiszár I, Narayan P. Secrecy generation for multiple input multiple output channel models. In IEEE International Symposium on Information Theory - Proceedings. 2009. p. 2447-2451. 5206054 https://doi.org/10.1109/ISIT.2009.5206054
Csiszár, I. ; Narayan, Prakash. / Secrecy generation for multiple input multiple output channel models. IEEE International Symposium on Information Theory - Proceedings. 2009. pp. 2447-2451
@inproceedings{1b2be1518017445e9f3eb8a3c61dec5c,
title = "Secrecy generation for multiple input multiple output channel models",
abstract = "Shannon theoretic secret key generation by several parties is considered for models in which a secure noisy channel with multiple input and 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 lower and upper bounds for 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. These bounds coincide in special cases, and the lower bounds are not tight in general. We also consider models in which different sets of terminals share multiple keys, one forterminals in each set with secrecy required from the eavesdropper as well as the remaining terminals in the other sets. Partial results include showing links among the associated secrecy capacity region for multiple keys, the transmission capacity region of the multiple access channel defined by the secure noisy channel, and achievable rates for a single secret key for all the terminals.",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "2009",
doi = "10.1109/ISIT.2009.5206054",
language = "English",
isbn = "9781424443130",
pages = "2447--2451",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Secrecy generation for multiple input multiple output channel models

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 2009

Y1 - 2009

N2 - Shannon theoretic secret key generation by several parties is considered for models in which a secure noisy channel with multiple input and 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 lower and upper bounds for 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. These bounds coincide in special cases, and the lower bounds are not tight in general. We also consider models in which different sets of terminals share multiple keys, one forterminals in each set with secrecy required from the eavesdropper as well as the remaining terminals in the other sets. Partial results include showing links among the associated secrecy capacity region for multiple keys, the transmission capacity region of the multiple access channel defined by the secure noisy channel, and achievable rates for a single secret key for all the terminals.

AB - Shannon theoretic secret key generation by several parties is considered for models in which a secure noisy channel with multiple input and 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 lower and upper bounds for 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. These bounds coincide in special cases, and the lower bounds are not tight in general. We also consider models in which different sets of terminals share multiple keys, one forterminals in each set with secrecy required from the eavesdropper as well as the remaining terminals in the other sets. Partial results include showing links among the associated secrecy capacity region for multiple keys, the transmission capacity region of the multiple access channel defined by the secure noisy channel, and achievable rates for a single secret key for all the terminals.

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

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

U2 - 10.1109/ISIT.2009.5206054

DO - 10.1109/ISIT.2009.5206054

M3 - Conference contribution

AN - SCOPUS:70449515425

SN - 9781424443130

SP - 2447

EP - 2451

BT - IEEE International Symposium on Information Theory - Proceedings

ER -