论文标题
匿名通信中的性能界限
SoK on Performance Bounds in Anonymous Communication
论文作者
论文摘要
匿名交流是有代价的 - 大型社区在更快的协议的开发与安全分析的改进之间一直处于拖拉机的持续拔河。从而证明了实现目标所需的最小间接费用，因此出现了更多复杂的隐私目标，并获得了更详细的范围。需求，方案和协议的纠缠使分析复杂化，并且由于偏差但具体的假设和目标选择（有些明确，最隐含的），公布的结果几乎是不可比的。在本文中，我们通过协调模型，比较验证的性能界限并将这些理论结果与广泛的建议和实施系统进行背景相关化，从而对该领域进行系统化。通过确定不准确性，我们证明了结果所基于的攻击确实超过了假定的弱隐私目标，并考虑到了途中的界限。我们进一步显示了两个看似替代的界限的等效性。最后，我们争辩说，论文的几个假设和要求在现实中可能有限，并为将来的工作建议放松。
Communicating anonymously comes at a cost - and large communities have been in a constant tug-of-war between the development of faster protocols, and the improvement of security analyses. Thereby more intricate privacy goals emerged and more detailed bounds on the minimum overhead necessary to achieve them were proven. The entanglement of requirements, scenarios, and protocols complicates analysis, and the published results are hardly comparable, due to deviating, yet specific choices of assumptions and goals (some explicit, most implicit). In this paper, we systematize the field by harmonizing the models, comparing the proven performance bounds, and contextualizing these theoretical results in a broad set of proposed and implemented systems. By identifying inaccuracies, we demonstrate that the attacks, on which the results are based, indeed break much weaker privacy goals than postulated, and tighten the bounds along the way. We further show the equivalence of two seemingly alternative bounds. Finally, we argue how several assumptions and requirements of the papers likely are of limited applicability in reality and suggest relaxations for future work.
