Paper 2023/918
Invertible Bloom Lookup Tables with Less Memory and Randomness
Abstract
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
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Minor revision. 32nd Annual European Symposium on Algorithms (ESA 2024)
- DOI
- https://doi.org/10.4230/LIPIcs.ESA.2024.54
- Keywords
- data structuresencrypted compressionlimited independence hashing
- Contact author(s)
-
mail @ nilsfleischhacker de
larsen @ cs au dk
Obremski math @ gmail com
mark simkin @ ethereum org - History
- 2024-11-26: revised
- 2023-06-12: received
- See all versions
- Short URL
- https://ia.cr/2023/918
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/918, author = {Nils Fleischhacker and Kasper Green Larsen and Maciej Obremski and Mark Simkin}, title = {Invertible Bloom Lookup Tables with Less Memory and Randomness}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/918}, year = {2023}, doi = {https://doi.org/10.4230/LIPIcs.ESA.2024.54}, url = {https://eprint.iacr.org/2023/918} }