Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy
Abstract
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.
Related
- From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels
- Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters
- Secrecy Outage Analysis over Correlated Composite Generalized-Gamma Fading Channels
- One-Shot Information Hiding and Compound Wiretap Channels
- Secure Deterministic Identification with Feedback and Sensing over State-Dependent Wiretap Channels
BibTeX
@misc{hayashi2026adaptive,
title = {{Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy}},
author = {Masahito Hayashi and Yanling Chen},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.13832},
eprint = {2609.13832},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.13832},
}
RIS
TY - UNPB
TI - Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy
AU - Masahito Hayashi
AU - Yanling Chen
PY - 2026
DA - 2026/09/12
PB - arXiv
DO - 10.48550/arxiv.2609.13832
UR - https://arxiv.org/abs/2609.13832
AB - 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.
ER -