Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy

2026-09-12

AI Summary

研究了单边强保密下双向窃听信道，通过开发非自适应和基于密钥的自适应内界解决用户1消息保密问题。

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.

Problem

• Two-Way Wiretap Channel
• Strong One-Sided Secrecy
• Adaptive Coding

Innovation

• Adaptive Coding
• Two-Way Wiretap Channels
• One-Sided Strong Secrecy
• Multiround Leakage Theorem
• Key-Assisted Adaptive Inner Bounds