all InfoSec news
Invertible Bloom Lookup Tables with Less Memory and Less Randomness. (arXiv:2306.07583v1 [cs.DS])
cs.CR updates on arXiv.org arxiv.org
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 crucially rely on fully random hash functions.
We present new constructions of IBLTs that are simultaneously more space
efficient and …
advanced applications correctness data design error failure memory protocols randomness study tables work