论文标题
分布式协议的自动攻击者合成
Automated Attacker Synthesis for Distributed Protocols
论文作者
论文摘要
分布式协议应对内部或外部对手的良性故障(例如数据包丢失或延迟)和攻击(例如消息重播)都具有鲁棒性。在本文中,我们采用一种正式的方法来自动合成攻击者,即可能导致协议故障的对抗过程。具体而言,鉴于一个正式的威胁模型捕获分布式协议模型和网络拓扑以及潜在攻击者的位置,目标和接口(输入和输出),我们会自动合成攻击者。我们正式化了四个攻击者的综合问题 - 跨越始终成功的攻击者与有时失败的攻击者,以及攻击的攻击者与那些没有失败的攻击者 - 我们向其中两个提出了算法解决方案。我们报告了一个名为KORG的原型实施及其在TCP中的应用,作为案例研究。我们的实验表明,Korg可以在几秒钟或分钟内自动为TCP产生众所周知的攻击。
Distributed protocols should be robust to both benign malfunction (e.g. packet loss or delay) and attacks (e.g. message replay) from internal or external adversaries. In this paper we take a formal approach to the automated synthesis of attackers, i.e. adversarial processes that can cause the protocol to malfunction. Specifically, given a formal threat model capturing the distributed protocol model and network topology, as well as the placement, goals, and interface (inputs and outputs) of potential attackers, we automatically synthesize an attacker. We formalize four attacker synthesis problems - across attackers that always succeed versus those that sometimes fail, and attackers that attack forever versus those that do not - and we propose algorithmic solutions to two of them. We report on a prototype implementation called KORG and its application to TCP as a case-study. Our experiments show that KORG can automatically generate well-known attacks for TCP within seconds or minutes.