Metraipolis › archive › dc_4bf9bb9a835f
Variational Probabilistic Quantization for Secret Key Generation — arXiv:2609.03205
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03205
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:48:11.416Z
- SHA-256 of the archived text
1c532ede34e34c3db93b8d97da99ae50e5340326d17223ccf7565b0526ae168a- Stable URL of this page
https://metraipolis.com/documento/dc_4bf9bb9a835f
How to cite
Variational Probabilistic Quantization for Secret Key Generation — arXiv:2609.03205 — arXiv (en), https://arxiv.org/abs/2609.03205 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4bf9bb9a835f (Metraipolis archive dc_4bf9bb9a835f, sha256 1c532ede34e34c3db93b8d97da99ae50e5340326d17223ccf7565b0526ae168a)
BibTeX
@misc{dc4bf9bb9a835f,
title = {Variational Probabilistic Quantization for Secret Key Generation — arXiv:2609.03205},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03205},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4bf9bb9a835f; sha256 1c532ede34e34c3db93b8d97da99ae50e5340326d17223ccf7565b0526ae168a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03205. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Secret key generation from correlated observations at Alice and Bob, in the presence of an eavesdropper Eve, underpins physical-layer security. Classical pipelines quantize by hand, amplify privacy afterwards, and optimize no objective tied to a key rate. We propose Variational Probabilistic Quantization (VPQ): neural encoders that map the correlated sources directly into a discrete key alphabet, trained by a variational adversarial objective whose entropy, mismatch, and leakage terms match the three terms of the one-way secret key rate. A linear code-offset secure sketch then reconciles the encoder outputs into an identical key without a separate privacy amplification step. We prove that the VPQ losses lower-bound the one-way secret key capacity of the induced source, and derive in closed form the optimal worst-case key rate over the source class of a given alphabet size and mismatch probability, attained by finite-field linear sketches. On Gaussian fading channels, VPQ leaks less to a correlated eavesdropper than one classical and two recent learning-based baselines, and Reed--Solomon reconciliation operates within the predicted finite-blocklength gap. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.03205 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T02:22:58.999Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).