Maximization of worst-case secret key rates in MIMO systems with eavesdropper

Author

Wolf, Anne ; Jorswieck, Eduard A.

Author_Institution

Dept. of Electr. Eng. & Inf. Technol., Dresden Univ. of Technol., Dresden, Germany

fYear

2011

fDate

5-9 Dec. 2011

Firstpage

869

Lastpage

873

Abstract

A multi-antenna (MIMO) system with eavesdropper is studied, where the transmitter has no perfect knowledge about the channel to the eavesdropper. The transmitter only knows that the channel matrix of the eavesdropper is drawn from a certain set. For this scenario, the worst-case secret key rate and the worst-case channel matrix of the eavesdropper are characterized. It is shown that the maximization of this rate under a sum power constraint at the transmitter is a saddle point problem. Upper and lower bounds for the maximized worst-case secret key rate are derived. Strategies for the high and low SNR regime are presented and the results are finally illustrated and discussed in comparison with the maximized worst-case secrecy rate.

Keywords

MIMO communication; antennas; cryptography; matrix algebra; radio transmitters; telecommunication security; MIMO system; eavesdropper; multiantenna system; saddle point problem; sum power constraint; transmitter; worst-case channel matrix; worst-case secret key rate maximization; MIMO; Optimization; Receivers; Signal to noise ratio; Transmitters; Vectors; MIMO system with eavesdropper; secret key rate maximization; wiretap channel; worst-case secret key rate;

fLanguage

English

Publisher

ieee

Conference_Titel

GLOBECOM Workshops (GC Wkshps), 2011 IEEE

Conference_Location

Houston, TX

Print_ISBN

978-1-4673-0039-1

Electronic_ISBN

978-1-4673-0038-4

Type

conf

DOI

10.1109/GLOCOMW.2011.6162580

Filename

6162580