3 papers
cs.DS2023
Invertible Bloom Lookup Tables with Less Memory and Randomness
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski +1
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 reconc…
cs.CR2021
Property-Preserving Hash Functions from Standard Assumptions
Nils Fleischhacker, Kasper Green Larsen, and Mark Simkin
Property-preserving hash functions allow for compressing long inputs and into short hashes and in a manner that allows for computing a predicate $P(x_…
cs.CR2014
Ubic: Bridging the gap between digital cryptography and the physical world
Mark Simkin, Dominique Schroeder, Andreas Bulling +1
Advances in computing technology increasingly blur the boundary between the digital domain and the physical world. Although the research community has developed a large number of c…