activity
20152020
most citedt-Private Information Retrieval Schemes Using Transitive Codes

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

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.IT2020★ 1 cited

Failure Probability Analysis for Partial Extraction from Invertible Bloom Filters

Ivo Kubjas, Vitaly Skachek

Invertible Bloom Filter (IBF) is a data structure, which employs a small set of hash functions. An IBF allows for an efficient insertion and, with high probability, for an efficien…