activity
20062026
most citedSemantically Secure Lattice Codes for the Gaussian Wiretap Channel

192 citations · 318 across the 33 of their papers we have counts for

collaborators
Showing cs.ITShow all

32 papers · 1 filter

cs.IT2026

Finite-blocklength performance of polar wiretap codes under a total variation secrecy constraint

Laura Luzzi, Valerio Bioglio

We study the performance of polarizing codes over a degraded symmetric wiretap channel under a total variation distance (TVD) secrecy constraint. We show that the leakage can be bo…

cs.IT2025

Covert Capacity of AWGN Channels under Average Error Probability

C. Bouette, L. Luzzi, M. Bloch

We derive upper and lower bounds for the covert capacity of Additive White Gaussian Noise channels when measuring reliability in terms of the average error probability and covertne…

cs.IT2024

Covert Communication Over Additive-Noise Channels

Cécile Bouette, Laura Luzzi, Ligong Wang

We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same…

cs.IT2023

Covert Communication over Two Types of Additive Noise Channels

Cécile Bouette, Laura Luzzi, Ligong Wang

We extend previous results on covert communication over the additive white Gaussian noise channel to two other types of additive noise channels. The first is the Gaussian channel w…

cs.IT2022

Optimal rate-limited secret key generation from Gaussian sources using lattices

Laura Luzzi, Cong Ling, Matthieu R. Bloch

We propose a lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves the strong secret key capacity in th…

cs.IT2021

Finite Blocklength Secrecy Analysis of Polar and Reed-Muller Codes in BEC Semi-Deterministic Wiretap Channels

Mahdi Shakiba-Herfeh, Laura Luzzi, Arsenia Chorti

In this paper, we consider a semi-deterministic wiretap channel where the main channel is noiseless and the eavesdropper's channel is a binary erasure channel (BEC). We provide a l…

cs.IT2021

The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes

Roope Vehkalahti, Laura Luzzi

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices…

cs.IT2018

Strong Coordination over Noisy Channels with Strictly Causal Encoding

Giulia Cervia, Laura Luzzi, Maël Le Treust +1

We consider a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of…

cs.IT2018

Polar codes for empirical coordination over noisy channels with strictly causal encoding

Giulia Cervia, Laura Luzzi, Maël Le Treust +1

In this paper, we propose a coding scheme based on polar codes for empirical coordination of autonomous devices. We consider a two-node network with a noisy link in which the input…

cs.IT2018

The DMT classification of real and quaternionic lattice codes

Laura Luzzi, Roope Vehkalahti

In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (D…

cs.IT2018★ 18 cited

Strong coordination of signals and actions over noisy channels with two-sided state information

Giulia Cervia, Laura Luzzi, Maël Le Treust +1

We consider a network of two nodes separated by a noisy channel with two-sided state information, in which the input and output signals have to be coordinated with the source and i…

cs.IT2017

Algebraic lattice codes for linear fading channels

Laura Luzzi, Roope Vehkalahti

In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number…

cs.IT2017

Strong Coordination of Signals and Actions over Noisy Channels

Giulia Cervia, Laura Luzzi, Maël Le Treust +1

-We develop a random binning scheme for strong coordination in a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated wit…

cs.IT2016

Almost universal codes for MIMO wiretap channels

Laura Luzzi, Roope Vehkalahti, Cong Ling

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…

cs.IT2016★ 10 cited

Polar Coding for Empirical Coordination of Signals and Actions over Noisy Channels

Giulia Cervia, Laura Luzzi, Matthieu Bloch +1

-We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source an…

cs.IT2016★ 10 cited

Almost universal codes for fading wiretap channels

Laura Luzzi, Cong Ling, Roope Vehkalahti

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 s…

cs.IT2015

Towards a complete DMT classification of division algebra codes

Laura Luzzi, Roope Vehkalahti, Alexander Gorodnik

This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime…

cs.IT2015★ 9 cited

Almost universal codes achieving ergodic MIMO capacity within a constant gap

Laura Luzzi, Roope Vehkalahti

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criter…

cs.IT2015★ 5 cited

Division algebra codes achieve MIMO block fading channel capacity within a constant gap

Laura Luzzi, Roope Vehkalahti

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to…

cs.IT2015

Estimates for the growth of inverse determinant sums of quasi-orthogonal and number field lattices

Roope Vehkalahti, Laura Luzzi

Inverse determinant sums appear naturally as a tool for analyzing performance of space-time codes in Rayleigh fading channels. This work will analyze the growth of inverse determin…

cs.IT2014★ 13 cited

Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap

Roope Vehkalahti, Laura Luzzi

This paper proves that a family of number field lattice codes simultaneously achieves a constant gap to capacity in Rayleigh fast fading and Gaussian channels. The key property in…

cs.IT2014

Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes

Roope Vehkalahti, Laura Luzzi, Jean-Claude Belfiore

This paper considers shifted inverse determinant sums arising from the union bound of the pairwise error probability for space-time codes in multiple-antenna fading channels. Previ…

cs.IT2013

A new design criterion for spherically-shaped division algebra-based space-time codes

Laura Luzzi, Roope Vehkalahti

This work considers normalized inverse determinant sums as a tool for analyzing the performance of division algebra based space-time codes for multiple antenna wireless systems. A…

cs.IT2013★ 1 cited

Secret key generation from Gaussian sources using lattice hashing

Cong Ling, Laura Luzzi, Matthieu R. Bloch

We propose a simple yet complete lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves strong secret ke…