Metraipolis › archive › dc_56aeafd6fddd
Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy — arXiv:2609.13832
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13832
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:34:29.083Z
- SHA-256 of the archived text
bed310ee683e2cd43c34f2ab140fad87651536a463411e33a63d0605bf9162f3- Stable URL of this page
https://metraipolis.com/documento/dc_56aeafd6fddd
How to cite
Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy — arXiv:2609.13832 — arXiv (en), https://arxiv.org/abs/2609.13832 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_56aeafd6fddd (Metraipolis archive dc_56aeafd6fddd, sha256 bed310ee683e2cd43c34f2ab140fad87651536a463411e33a63d0605bf9162f3)
BibTeX
@misc{dc56aeafd6fddd,
title = {Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy — arXiv:2609.13832},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13832},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_56aeafd6fddd; sha256 bed310ee683e2cd43c34f2ab140fad87651536a463411e33a63d0605bf9162f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13832. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study a discrete memoryless two-way wiretap channel under strong one-sided secrecy, where User 1's message is confidential and User 2's message is not required to be secret. We develop non-adaptive and key-assisted adaptive inner bounds from a common resolvability estimate for selected index components. For the adaptive construction, we prove a multiround leakage theorem that accounts both for information revealed about a key before its later use and for the possibility that an encoder uses an incorrectly decoded key. The proof includes an ideal-to-implemented coupling, deterministic codebook selection, and a growing-round argument that removes the initialization-rate loss. We eliminate the internal component rates exactly and characterize the adaptive gain at each fixed auxiliary distribution. For an open two-parameter family of binary channels, we also prove a converse for arbitrary non-adaptive stochastic codes and obtain an operational adaptive-versus-non-adaptive separation. For one representative channel, the complete non-adaptive strong one-sided secrecy capacity region is identified exactly. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.13832 — 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-16T01:21:38.607Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).