Authentication over Arbitrarily Varying Channels with Causal Adversaries

2026-08-28

AI Summary

本文研究了在具有因果对手的任意变化信道上进行身份验证的问题，通过构建正速率码和使用martingale集中论点来解决该问题。

Abstract

We study authentication over a discrete memoryless arbitrarily varying channel (AVC) in which the adversary selects the channel state causally based on past channel outputs. We prove that the authentication capacity is positive exactly when the channel is not distribution-overwritable under stochastic encoding, and not I-overwritable under deterministic encoding. In the stochastic case, whenever the authentication capacity is positive, it coincides with the no-adversary Shannon capacity. Both converses follow from a novel wait-and-overwrite attack: the adversary tracks the no-adversary posterior over the message via the posterior guessing probability, and once it concentrates past a threshold, it samples a guess and a decoy from the posterior and overwrites the channel to mimic a no-adversary transmission of the decoy. The positivity results are obtained by constructing positive-rate codes with controlled overlap between codewords, together with a martingale concentration argument that handles adaptive adversarial strategies. For stochastic encoding, the full-capacity achievability further combines a capacity-achieving channel code with an authentication tag. These characterizations separate the causal stochastic-code and causal deterministic-code settings from each other and from the oblivious-adversary setting studied by Kosut and Kliewer.

Problem

• arbitrarily varying channel
• causal adversaries
• authentication capacity

Innovation

• wait-and-overwrite attack
• stochastic encoding
• causal adversaries
• authentication capacity
• arbitrarily varying channel