一次性信息隐藏与复合窃听信道
One-Shot Information Hiding and Compound Wiretap Channels
- The Chinese University of Hong Kong（香港中文大学）
- Imperial College London（帝国理工学院）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
针对信道不确定性下的信息隐藏与复合窃听信道，提出统一框架并推导适用于任意源分布和信道类别的一次性可达性结果，涵盖主动攻击与被动窃听场景。
AI中文摘要：
近年来，由于通信、分析和利用的大量数据日益增长，这些数据本质上包含敏感和个人信息，通信中的保密性和隐私性变得越来越重要。我们在信道不确定性下对两个基本保密问题进行了非渐近信息论分析：信息隐藏问题和复合窃听信道。前者允许博弈论公式化，其中一方（信息隐藏者和解码器）寻求将秘密消息嵌入宿主信号以供后续重建，而对立的一方（攻击者）试图移除或降级嵌入的信息。后者通过允许多个潜在信道状态来推广Wyner的窃听信道。信息隐藏问题涉及数据传输期间的主动攻击，而复合窃听信道处理被动窃听和信息泄露。这两个问题都考虑具有不确定性的信道，可以通过利用覆盖论证和Li和Anantharam的泊松匹配引理在统一框架下进行研究。我们为这两个问题推导了新颖的一次性可达性结果，这些结果适用于任何源分布和任何类别的信道（不一定是无记忆或遍历的），并且适用于离散和连续情况。我们还表明，通过将我们的结果应用于离散无记忆信道，可以恢复这两个问题上现有的渐近结果。
英文摘要：
In recent years, due to the growing reliance on large amounts of data that are communicated, analyzed, and utilized, which inherently contain sensitive and personal information, secrecy and privacy in communication have become increasingly important. We present nonasymptotic information-theoretic analyses of two fundamental secrecy problems under channel uncertainties: the information hiding problem and the compound wiretap channel. The former admits a game-theoretic formulation, where one party (an information hider and a decoder) seeks to embed secret messages into a host signal for later reconstruction, while the opposing party (an attacker) attempts to remove or degrade the embedded information. The latter generalizes Wyner's wiretap channel by allowing multiple potential channel states. The information hiding problem concerns active attacks during data transmission, while the compound wiretap channel addresses passive eavesdropping and information leakage. The two problems, both of which consider channels with uncertainties, can be studied under a unified framework by utilizing a covering argument and the Poisson matching lemma by Li and Anantharam. We derive novel one-shot achievability results for both problems that are applicable to any source distribution and any class of channels (not necessarily memoryless or ergodic), and that apply to both discrete and continuous cases. We also show that existing asymptotic results on both problems can be recovered by applying our results to discrete memoryless channels.
