论文标题
基于范围的设置对帐
Range-Based Set Reconciliation
论文作者
论文摘要
基于范围的集合对帐是一种简单的方法，可以在网络上有效地计算两个集合的联合，基于递归对集合进行分区并比较分区的指纹以概率地检测分区是否需要进一步工作。尽管此方法的先前介绍集中在特定用例的特定指纹方案上，但我们在集合和解的更广泛背景下提供了更通用的描述和分析。精确地捕获指纹方案的设计空间，使我们能够调查密码安全方案。此外，与以前的出版物相比，我们通过对数因素降低了局部计算的时间复杂性。
Range-based set reconciliation is a simple approach to efficiently computing the union of two sets over a network, based on recursively partitioning the sets and comparing fingerprints of the partitions to probabilistically detect whether a partition requires further work. Whereas prior presentations of this approach focus on specific fingerprinting schemes for specific use-cases, we give a more generic description and analysis in the broader context of set reconciliation. Precisely capturing the design space for fingerprinting schemes allows us to survey for cryptographically secure schemes. Furthermore, we reduce the time complexity of local computations by a logarithmic factor compared to previous publications.
