论文标题
针对近视对手的身份验证
Authentication Against a Myopic Adversary
论文作者
论文摘要
我们考虑在近视对手存在下进行点对点通信的无钥匙身份验证。特别是,对手可以访问传输的非杂音噪声版本,并可以使用此知识来选择合法用户之间任意变化的渠道的渠道状态;如果接收器要么将其解码为正确的消息或正确检测到对抗干扰,因此成功。我们表明,一种称为U跨度的频道条件,它使对手能够使其错误消息显得合理且未受到损害,这是零身份验证能力的足够条件。我们提出了一种比较对抗频道的有用方法,并表明一旦AVC变得u-Orcroverable,它对于所有“少近视”对手来说仍然是U的。最后,我们表明,在某些情况下,随机编码器对于积极身份验证能力是必需的,并详细检查了一个说明了这种必要性的二元对抗通道。也就是说,对于此二进制渠道,我们表明,当对抗通道相对于用户之间的主要渠道降解时,可以通过确定性编码器实现基础渠道的无反向能力。否则,只要对手的渠道不是完美的,那么随机编码器对于积极的身份验证能力是必需的。如果允许这样的编码器,则可以再次实现无对抗的能力。
We consider keyless authentication for point-to-point communication in the presence of a myopic adversary. In particular, the adversary has access to a non-causal noisy version of the transmission and may use this knowledge to choose the channel state of an arbitrarily-varying channel between legitimate users; the receiver is successful if it either decodes to the correct message or correctly detects adversarial interference. We show that a channel condition called U-overwritability, which allows the adversary to make its false message appear legitimate and untampered with, is a sufficient condition for zero authentication capacity. We present a useful way to compare adversarial channels, and show that once an AVC becomes U-overwritable, it remains U-overwritable for all "less myopic" adversaries. Finally, we show that stochastic encoders are necessary for positive authentication capacity in some cases, and examine in detail a binary adversarial channel that illustrates this necessity. Namely, for this binary channel, we show that when the adversarial channel is degraded with respect to the main channel between users, the no-adversary capacity of the underlying channel is achievable with a deterministic encoder. Otherwise, provided the channel to the adversary is not perfect, a stochastic encoder is necessary for positive authentication capacity; if such an encoder is allowed, the no-adversary capacity is again achievable.