论文标题
布鲁姆树
The Bloom Tree
论文作者
论文摘要
我们引入了一个数据结构，该数据结构允许以带宽有效且安全的方式进行有效的（概率）证明和非稳定的不存在证明。布鲁姆树将绽放过滤器的想法与默克尔树的概念结合在一起。 Bloom filters are used to verify the presence, or absence of elements in a set.对于Bloom树，我们有兴趣以安全和带宽有效的方式验证和传递元素的存在或不存在元素到另一方。 Bloom树没有发送整个Bloom过滤器检查是否存在或不存在元素，而是通过使用紧凑的Merkle Multiproof来实现有效的验证。
We introduce a data structure that allows for efficient (probabilistic) presence proofs and non-probabilistic absence proofs in a bandwidth efficient and secure way. The Bloom tree combines the idea of Bloom filters with that of Merkle trees. Bloom filters are used to verify the presence, or absence of elements in a set. In the case of the Bloom tree, we are interested to verify and transmit the presence, or absence of an element in a secure and bandwidth efficient way to another party. Instead of sending the whole Bloom filter to check for the presence, or absence of an element, the Bloom tree achieves efficient verification by using a compact Merkle multiproof.
