Almost Universal Codes for MIMO Wiretap Channels

DOI10.1109/TIT.2018.2857487zbMATH Open1431.94162arXiv1611.01428OpenAlexW2883882804WikidataQ110041984 ScholiaQ110041984MaRDI QIDQ4559596FDOQ4559596

Cong Ling, Laura Luzzi, Roope Vehkalahti

Publication date: 4 December 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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 $$ are achievable, where $$ is a lower bound for Bob's capacity and $$ is an upper bound for Eve's capacity for all the channels in the set.

Full work available at URL: https://arxiv.org/abs/1611.01428

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cited In (3)

• Non-commutative ring learning with errors from cyclic algebras
• Random algebraic lattices and codes for wireless communications
• The MIMO Wiretap Channel Decomposed

This page was built for publication: Almost Universal Codes for MIMO Wiretap Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559596)