Optimal Rate-Limited Secret Key Generation From Gaussian Sources Using Lattices - ETIS, équipe ICI
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2023

Optimal Rate-Limited Secret Key Generation From Gaussian Sources Using Lattices

Résumé

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 the use of the modulo lattice operation 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 might be 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.
Fichier principal
Vignette du fichier
Secret_key_generation_final.pdf (496.32 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04518086 , version 1 (23-03-2024)

Identifiants

Citer

Laura Luzzi, Cong Ling, Matthieu Bloch. Optimal Rate-Limited Secret Key Generation From Gaussian Sources Using Lattices. IEEE Transactions on Information Theory, 2023, 69 (8), pp.4944-4960. ⟨10.1109/TIT.2023.3266033⟩. ⟨hal-04518086⟩
47 Consultations
26 Téléchargements

Altmetric

Partager

More