A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Almost Universal Codes for MIMO Wiretap Channels
Tekijät: Laura Luzzi, Roope Vehkalahti, Cong Ling
Kustantaja: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Julkaisuvuosi: 2018
Journal: IEEE Transactions on Information Theory
Tietokannassa oleva lehden nimi: IEEE TRANSACTIONS ON INFORMATION THEORY
Lehden akronyymi: IEEE T INFORM THEORY
Vuosikerta: 64
Numero: 11
Aloitussivu: 7218
Lopetussivu: 7241
Sivujen määrä: 24
ISSN: 0018-9448
DOI: https://doi.org/10.1109/TIT.2018.2857487
Tiivistelmä
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper's channel. We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance/minimum determinant of the lattice and its dual should be maximized simultaneously. Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case. The proposed lattice codes achieve strong secrecy and semantic security for all rates R < C-b - C-e - kappa, where C-b and C-e are Bob and Eve's channel capacities, respectively, and kappa is an explicit constant gap. Furthermore, these codes are almost universal in the sense that a fixed code is good for secrecy for a wide range of fading models. Finally, we consider a compound wiretap model with a more restricted uncertainty set, and show that rates R < (C) over bar (b) - (C) over bar (e) - kappa are achievable, where (C) over bar (b) is a lower bound for Bob's capacity and (C) over bar (e) is an upper bound for Eve's capacity for all the channels in the set.
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper's channel. We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance/minimum determinant of the lattice and its dual should be maximized simultaneously. Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case. The proposed lattice codes achieve strong secrecy and semantic security for all rates R < C-b - C-e - kappa, where C-b and C-e are Bob and Eve's channel capacities, respectively, and kappa is an explicit constant gap. Furthermore, these codes are almost universal in the sense that a fixed code is good for secrecy for a wide range of fading models. Finally, we consider a compound wiretap model with a more restricted uncertainty set, and show that rates R < (C) over bar (b) - (C) over bar (e) - kappa are achievable, where (C) over bar (b) is a lower bound for Bob's capacity and (C) over bar (e) is an upper bound for Eve's capacity for all the channels in the set.
Turun yliopiston Tutkimustietojärjestelmän portaali