Almost universal codes for fading wiretap channels
Laura Luzzi, Cong Ling, Roope Vehkalahti

TL;DR
This paper introduces a universal lattice coding scheme that achieves strong secrecy and semantic security over fading wiretap channels, regardless of the specific fading model, with performance close to the secrecy capacity.
Contribution
It presents a novel sequence of non-random lattice codes that are nearly universal, achieving near-capacity secrecy over both Gaussian and ergodic fading channels.
Findings
Achieves strong secrecy and semantic security
Works universally over different fading models
Close to secrecy capacity with constant gap
Abstract
We consider a fading wiretap channel model where the transmitter has only statistical channel state information, and the legitimate receiver and eavesdropper have perfect channel state information. We propose a sequence of non-random lattice codes which achieve strong secrecy and semantic security over ergodic fading channels. The construction is almost universal in the sense that it achieves the same constant gap to secrecy capacity over Gaussian and ergodic fading models.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
