论假冒攻击的威力
On the Power of Impersonation Attacks
摘要：
在本文中，我们考虑一个同步消息传递系统，在每一轮的外部对手能够发送每个处理器多达k个消息伪造的发送者身份和任意的内容。它正式表明，这种模拟模型是略强于异步消息传递模型崩溃失败。特别地，我们证明了（k+1）-集协议可以解决这个模型，而k-集协议是不可能的，任何k>=1。异步模型和模拟模型的不同强度表现在保序重命名问题上，对于保序重命名问题，模拟模型中存在具有n+k个目标命名空间的算法，而在保序重命名情况下需要指数级更大的命名空间。
英文摘要：
In this paper we consider a synchronous message passing system in which in every round an external adversary is able to send each processor up to k messages with falsified sender identities and arbitrary content. It is formally shown that this impersonation model is slightly stronger than the asynchronous message passing model with crash failures. In particular, we prove that (k+1)-set agreement can be solved in this model, while k-set agreement is impossible, for any k>=1. The different strength of the asynchronous and impersonation models is exhibited by the order preserving renaming problem, for which an algorithm with n+k target namespace exists in the impersonation model, while an exponentially larger namespace is required in case of asynchrony.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
