Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

From MaRDI portal
Publication:2986109

DOI10.1109/TIT.2014.2343226zbMATH Open1360.94417arXiv1210.6673OpenAlexW2018877773MaRDI QIDQ2986109FDOQ2986109


Authors: Cong Ling, Laura Luzzi, Jean-Claude Belfiore, Damien Stehlé Edit this on Wikidata


Publication date: 16 May 2017

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

Abstract: We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the {flatness factor} as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the latter case, we propose a novel secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No extit{a priori} distribution of the message is assumed, and no dither is used in our proposed schemes.


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







Cited In (7)





This page was built for publication: Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

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