双向窃听信道的自适应编码与单侧强保密
Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy
- The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳））
- International Quantum Academy (SIQA)（国际量子科学院）
- Graduate School of Mathematics, Nagoya University（名古屋大学大学院数学研究科）
- Volkswagen Infotainment GmbH（大众信息娱乐有限公司）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本文研究双向窃听信道在单侧强保密下的自适应编码，提出密钥辅助自适应内界并证明多轮泄漏定理，精确刻画容量区域，实现自适应与非自适应的分离。
AI中文摘要：
我们研究了在强单侧保密条件下的离散无记忆双向窃听信道，其中用户1的消息是保密的，而用户2的消息不要求保密。我们从针对选定索引分量的公共可解析性估计出发，发展了非自适应和密钥辅助的自适应内界。对于自适应构造，我们证明了一个多轮泄漏定理，该定理既考虑了密钥在后续使用之前所泄露的信息，也考虑了编码器使用错误解码密钥的可能性。证明包括理想到实现的耦合、确定性码本选择以及一个消除初始化速率损失的渐增轮数论证。我们精确地消除了内部分量速率，并刻画了在每个固定辅助分布下的自适应增益。对于一类开放的双参数二进制信道族，我们还证明了任意非自适应随机码的逆命题，并获得了操作性的自适应与非自适应分离。对于一个代表性信道，完整的非自适应强单侧保密容量区域被精确确定。
英文摘要：
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.
