activity
20192026
most citedTowards Privacy-assured and Lightweight On-chain Auditing of Decentralized Storage

2 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2019★ 1 cited

Matrix Bloom Filter: An Efficient Probabilistic Data Structure for 2-tuple Batch Lookup

Yue Fu, Rong Du, Haibo Hu +2

With the growing scale of big data, probabilistic structures receive increasing popularity for efficient approximate storage and query processing. For example, Bloom filters (BF) c…