Invertible Bloom Lookup Tables with Less Memory and Randomness

ePrint Report: Invertible Bloom Lookup Tables with Less Memory and Randomness

Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin

In this work we study Invertible Bloom Lookup Tables (IBLTs) with small failure probabilities. IBLTs are highly versatile data structures that have found applications in set reconciliation protocols, error-correcting codes, and even the design of advanced cryptographic primitives. For storing $n$ elements and ensuring correctness with probability at least $1 - \delta$, existing IBLT constructions require $\Omega(n(\frac{\log(1/\delta)}{\log(n)}+1))$ space and they …

applications data eprint report error failure green mark memory protocols randomness report study tables work