Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute
the intersection of their sets without revealing anything except the intersection. We use fully …

We present a version of the Bloom filter data structure that supports not only the insertion,
deletion, and lookup of key-value pairs, but also allows a complete listing of the pairs it …

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation Page 1
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation Michael T …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Cuckoo hashing holds great potential as a high-performance hashing scheme for real
applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that …

We demonstrate an efficient data-parallel algorithm for building large hash tables of millions
of elements in real-time. We consider two parallel algorithms for the construction: a classical …

Cuckoo hashing is a powerful primitive that enables storing items using small space with
efficient querying. At a high level, cuckoo hashing maps n items into b entries storing at most …

We study the security of Probabilistic Data Structures (PDS) for handling Approximate
Membership Queries (AMQ); prominent examples of AMQ-PDS are Bloom and Cuckoo …

Background One of the tasks in the iDASH Secure Genome Analysis Competition in 2016
was to demonstrate the feasibility of privacy-preserving queries on homomorphically …

Many tasks in computer systems could be abstracted as distributing items into buckets, so
that the allocation of items across buckets is as balanced as possible, and furthermore …