开花树
The Bloom Tree
摘要：
我们引入了一个数据结构，允许有效的（概率）存在证明和非概率不存在证明的带宽效率和安全的方式。Bloom树结合了Bloom过滤器和Merkle树的思想。布隆过滤器用于验证集合中元素的存在或不存在。在Bloom树的情况下，我们感兴趣的是以安全和带宽有效的方式验证和传输元素的存在或不存在。而不是发送整个Bloom过滤器来检查元素的存在或不存在，Bloom树通过使用紧凑的Merkle多重证明来实现有效的验证。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
