Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

DOI10.1109/TIT.2014.2343226MaRDI QIDQ2986109zbMATH OpenOpenAlexFDO

Authors Cong Ling, Laura Luzzi, Jean-Claude Belfiore, Damien Stehlé

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Combinatorial codes (94B25)

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.

Cited in

(13)

• Some ``good properties of LDA lattices
• Random algebraic lattices and codes for wireless communications
• Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis
• An Approximation of Theta Functions with Applications to Communications
• Wiretap lattice codes from number fields with no small norm elements
• Euclidean lattices: theory and applications
• On Gaussian sampling for q-ary lattices and linear codes with Lee weight
• A design criterion for the Rayleigh fading wiretap channel based on ^1-norm theta functions
• Discrete Gaussian sampling for BKZ-reduced basis
• Dense generic well-rounded lattices
• Mathematics of digital communications: from finite fields to group rings and noncommutative algebra
• Solving the shortest vector problem in \(2^{0.63269n+o(n)}\) time on random lattices
• 2- and 3-modular lattice wiretap codes in small dimensions

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)