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.

翻译：基于范围的数据集调和是一种通过网络高效计算两个集合并集的简单方法。该方法通过递归划分数据集，并比较各分区的指纹来概率性检测该分区是否需要进一步处理。已有研究针对特定用例提出了特定的指纹方案，而本文在数据集调和的更广泛背景下给出了更通用的描述与分析。通过精确刻画指纹方案的设计空间，我们得以探索具有密码学安全性的方案。此外，与以往文献相比，我们将本地计算的时间复杂度降低了一个对数因子。