Laura Luzzi

Assistant professor (Maître de Conférences) at ENSEA.

Articles

1. L. Luzzi, C. Ling, and M. R. Bloch, “Optimal rate-limited secret key generation from Gaussian sources using lattices,” IEEE Transactions on Information Theory, vol. 69, no. 8, pp. 4944–4960, Aug. 2023.

   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 the case of degraded source models, as well as the optimal secret key / public communication rate trade-off. The key ingredients of our scheme are a lattice extractor to extract the channel intrinsic randomness, based on the notion of flatness factor, together with a randomized lattice quantization technique to quantize the continuous source. Compared to previous works, we introduce two new notions of flatness factor based on L1 distance and KL divergence, respectively, which are of independent interest. We prove the existence of secrecy-good lattices under L1 distance and KL divergence, whose L1 and KL flatness factors vanish for volume-to-noise ratios up to 2πe. This improves upon the volume-to-noise ratio threshold 2π of the L∞ flatness factor.

   @article{Luzzi2022Secret, author = {Luzzi, Laura and Ling, Cong and Bloch, Matthieu R.}, journal = {IEEE Transactions on Information Theory}, title = {Optimal rate-limited secret key generation from Gaussian sources using lattices}, year = {2023}, month = aug, number = {8}, pages = {4944-4960}, volume = {69}, doi = {10.1109/TIT.2023.3266033}, eprint = {2206.10443}, file = {:2023-Luzzi-IEEETransIT-Optimal Rate-Limited Secret Key Generation From Gaussian Sources Using Lattices.pdf:PDF}, groups = {NSF1955401, NSF2148400}, howpublished = {accepted to \emph{IEEE Transactions on Information Theory}} }

2. G. Cervia, L. Luzzi, M. Le Treust, and M. Bloch, “Strong Coordination of Signals and Actions over Noisy Channels with two-sided State Information,” IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 4681–4708, Aug. 2020.

   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 its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the inner and outer bounds do not match in general, we provide a complete characterization of the strong coordination region in three particular cases: i) when the channel is perfect; ii) when the decoder is lossless; and iii) when the random variables of the channel are independent from the random variables of the source. Through the study of these special cases, we prove that the separation principle does not hold for joint source-channel strong coordination. Finally, in the absence of state information, we show that polar codes achieve the best known inner bound for the strong coordination region, which therefore offers a constructive alternative to random binning and coding proofs.

   @article{Cervia2018, author = {Cervia, Giulia and Luzzi, Laura and {Le Treust}, Ma\"el and Bloch, Matthieu}, title = {Strong Coordination of Signals and Actions over Noisy Channels with two-sided State Information}, journal = {IEEE Transactions on Information Theory}, year = {2020}, volume = {66}, number = {8}, pages = {4681-4708}, month = aug, doi = {10.1109/TIT.2020.2984345}, eprint = {1801.10543}, file = {:2020-Cervia-IEEETransIT.pdf:PDF}, howpublished = {accepted to \emph{IEEE Transactions on Information Theory}} }

Conference proceedings

1. G. Cervia, L. Luzzi, M. Le Treust, and M. R. Bloch, “Strong coordination over noisy channels with strictly causal encoding,” in Proc. of 56th Annual Allerton Conference on Communication, Control, and Computing, Oct. 2018, pp. 519–526.

   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 strictly causal encoding and non-causal decoding, we prove inner and outer bounds for the strong coordination region and show that the inner bound is achievable with polar codes.

   @inproceedings{Cervia2018a, author = {Cervia, Giulia and Luzzi, Laura and {Le Treust}, Mael and Bloch, Matthieu R}, title = {Strong coordination over noisy channels with strictly causal encoding}, booktitle = {Proc. of 56th Annual Allerton Conference on Communication, Control, and Computing}, year = {2018}, pages = {519-526}, month = oct, doi = {10.1109/ALLERTON.2018.8635991}, eprint = {1809.10934}, groups = {Coordination of networks}, keywords = {Decoding;Encoding;Noise measurement;Memoryless systems;Markov processes;Communication networks} }

2. G. Cervia, L. Luzzi, M. L. Treust, and M. R. Bloch, “Strong Coordination of Signals and Actions over Noisy Channels,” in Proc. of IEEE International Symposium on Information Theory, Aachen, Germany, Jun. 2017, pp. 2845–2849.

   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 with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the set of achievable target distributions is the same as for empirical coordination, we characterize the rate of common randomness required for strong coordination.

   @inproceedings{Cervia2017, author = {Cervia, Giulia and Luzzi, Laura and Treust, Ma\"el Le and Bloch, Matthieu R}, title = {Strong Coordination of Signals and Actions over Noisy Channels}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, year = {2017}, pages = {2845--2849}, address = {Aachen, Germany}, month = jun, doi = {10.1109/ISIT.2017.8007047}, groups = {Coordination of networks}, howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}} }

3. C. Ling, L. Luzzi, and M. R. Bloch, “Secret key generation from Gaussian sources using lattice hashing,” in Proc. of IEEE International Symposium on Information Theory, Istanbul, Turkey, Jul. 2013, pp. 2621–2625.

   @inproceedings{Lin2013, author = {Ling, Cong and Luzzi, Laura and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, title = {Secret key generation from Gaussian sources using lattice hashing}, year = {2013}, address = {Istanbul, Turkey}, month = jul, pages = {2621-2625}, creationdate = {2013-01-21T00:00:00}, doi = {10.1109/ISIT.2013.6620701}, eprint = {1306.5299}, file = {:2010-Ling-ISIT.pdf:PDF}, groups = {Secret key agreement}, issn = {2157-8095}, keywords = {Encoding;Error probability;Lattices;Quantization (signal);Vectors;Zinc}, owner = {mattbloch}, quality = {1} }

4. M. R. Bloch, L. Luzzi, and J. Kliewer, “Strong Coordination with Polar Codes,” in Proc. of 50th Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2012, pp. 565–571.

   In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a symmetric discrete memoryless channel. By observing that polar codes are useful for channel resolvability over binary symmetric channels, we prove that nested polar codes achieve a subset of the strong coordination capacity region, and therefore provide a constructive and low complexity solution for strong coordination.

   @inproceedings{Bloch2012a, author = {Bloch, Matthieu R. and Luzzi, Laura and Kliewer, Joerg}, booktitle = {Proc. of 50th Allerton Conference on Communication, Control, and Computing}, title = {{S}trong Coordination with Polar Codes}, year = {2012}, address = {Monticello, IL}, month = oct, pages = {565-571}, arxiv = {1210.2159}, creationdate = {2012-07-15T00:00:00}, doi = {10.1109/Allerton.2012.6483268}, file = {:2012-Bloch-Allerton.pdf:PDF}, groups = {Coordination of networks, Polar codes}, howpublished = {accepted to \emph{50th Allerton Conference on Communication, Control, and Computing}}, owner = {mattbloch} }

5. L. Luzzi and M. R. Bloch, “Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels,” in Proc. of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, Cachan, France, May 2011, pp. 641–647.

   @inproceedings{Luzzi2011, author = {Luzzi, Laura and Bloch, Matthieu R.}, booktitle = {Proc. of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools}, title = {{C}apacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels}, year = {2011}, address = {Cachan, France}, month = may, note = {(invited)}, pages = {641--647}, creationdate = {2011-04-16T00:00:00}, groups = {Wiretap channels}, howpublished = {accepted at \emph{SecureNets 2011}}, owner = {mattbloch} }