Invertible Bloom Lookup Tables with Less Memory and Randomness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fleischhacker, Nils, Larsen, Kasper Green, Obremski, Maciej, Simkin, Mark
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2306.07583