Title :
Secrecy generation for multiple input multiple output channel models
Author :
Csiszár, Imre ; Narayan, Prakash
Author_Institution :
A. Renyi Inst. of Math., Hungarian Acad. of Sci., Budapest, Hungary
fDate :
June 28 2009-July 3 2009
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 for terminals 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.
Keywords :
MIMO communication; information theory; telecommunication security; Shannon theoretic secret key generation; eavesdropper; multiple access channel; multiple input multiple output channel models; multiple keys; noisy channel security; public communication; public noiseless channel; transmission capacity region; Channel capacity; Character generation; Educational institutions; MIMO; Mathematical model; Mathematics; Memoryless systems; Noise generators; Upper bound;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5206054