arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.6331cs.ITcs.CRmath.IT
收藏

从信息论角度看主动攻击:数据修改攻击

Active Adversaries from an Information-Theoretic Perspective: Data Modification Attacks

Mahtab Mirmohseni, Panagiotis Papadimitratos

摘要:

我们调查的问题,可靠的通信中存在的活跃的对手,可以篡改传输的数据。我们考虑一个合法的发射机-接收机对连接在多个通信路径(路由)。我们提出了两种新的模型的对手,一个“无记忆”和“预见”的对手。对于这两种模型,对手将自己任意放置在路由上,在整个传输块中保持其位置固定。发射机可能知道也可能不知道该放置。对手可以选择他们最好的修改策略,以增加在合法接收器的错误,受到最大失真约束。我们调查的通信速率,可以实现在存在的两种类型的对手和信道(良性)的随机行为。对于无记忆的对手,容量是派生的。我们的方法是在一个复合通道中使用所有可能的对抗策略(包括最好的策略)的预期接收信号的典型集合,该通道也捕获对抗布局。对于有预见能力的对手,与无记忆对手相比,它们具有增强的观察能力,我们提出了一种新的编码方案来保证弹性,即,码字的恢复独立于对抗(最佳)选择。我们推导出一个可实现的速率,我们提出了一个上限的能力。我们评估我们的一般结果的具体情况下(例如,二进制符号替换或擦除攻击),以获得见解。

英文摘要:

We investigate the problem of reliable communication in the presence of active adversaries that can tamper with the transmitted data. We consider a legitimate transmitter-receiver pair connected over multiple communication paths (routes). We propose two new models of adversary, a "memoryless" and a "foreseer" adversary. For both models, the adversaries are placing themselves arbitrarily on the routes, keeping their placement fixed throughout the transmission block. This placement may or may not be known to the transmitter. The adversaries can choose their best modification strategy to increase the error at the legitimate receiver, subject to a maximum distortion constraint. We investigate the communication rates that can be achieved in the presence of the two types of adversaries and the channel (benign) stochastic behavior. For memoryless adversaries, the capacity is derived. Our method is to use the typical set of the anticipated received signal for all possible adversarial strategies (including their best one) in a compound channel that also captures adversarial placement. For the foreseer adversaries, which have enhanced observation capabilities compared to the memoryless ones, we propose a new coding scheme to guarantee resilience, i.e., recovery of the codeword independently of the adversarial (best) choice. We derive an achievable rate and we propose an upper bound on the capacity. We evaluate our general results for specific cases (e.g., binary symbol replacement or erasing attacks), to gain insights.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑