1 citations · 2 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 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…
cs.IT2017★ 1 cited
t-Private Information Retrieval Schemes Using Transitive Codes
Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti +3
This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR sc…