Secret key generation from Gaussian sources using lattice hashing
Cong Ling, Laura Luzzi, Matthieu R. Bloch

TL;DR
This paper introduces a lattice-based scheme for secret key generation from Gaussian sources, achieving near-optimal secret key rates without requiring dithering, and utilizing novel lattice-hashing techniques based on flatness factor and intrinsic randomness.
Contribution
It presents a complete lattice-hashing scheme for secret key generation that is simple, does not need dithering, and achieves near-optimal secret key rates in degraded source models.
Findings
Achieves secret key rates up to 1/2 nat in degraded models.
Introduces a lattice-hashing technique based on flatness factor.
Does not require dithering in the scheme.
Abstract
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 key rates up to 1/2 nat from the optimal in the case of "degraded" source models. The novel ingredient of our scheme is a lattice-hashing technique, based on the notions of flatness factor and channel intrinsic randomness. The proposed scheme does not require dithering.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Advanced Steganography and Watermarking Techniques · Chaos-based Image/Signal Encryption
