Fast private set intersection from homomorphic encryption
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 …
the intersection of their sets without revealing anything except the intersection. We use fully …
Privacy-preserving access of outsourced data via oblivious RAM simulation
MT Goodrich, M Mitzenmacher - International Colloquium on Automata …, 2011 - Springer
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation Page 1
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation Michael T …
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation Michael T …
Invertible bloom lookup tables
MT Goodrich, M Mitzenmacher - 2011 49th Annual Allerton …, 2011 - ieeexplore.ieee.org
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 …
deletion, and lookup of key-value pairs, but also allows a complete listing of the pairs it …
Real-time parallel hashing on the GPU
DA Alcantara, A Sharf, F Abbasinejad… - ACM SIGGRAPH asia …, 2009 - dl.acm.org
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 …
of elements in real-time. We consider two parallel algorithms for the construction: a classical …
More robust hashing: Cuckoo hashing with a stash
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 …
applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that …
Cuckoo hashing in cryptography: Optimal parameters, robustness and applications
K Yeo - Annual International Cryptology Conference, 2023 - Springer
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 …
efficient querying. At a high level, cuckoo hashing maps n items into b entries storing at most …
Adversarial correctness and privacy for probabilistic data structures
M Filic, KG Paterson, A Unnikrishnan… - Proceedings of the 2022 …, 2022 - dl.acm.org
We study the security of Probabilistic Data Structures (PDS) for handling Approximate
Membership Queries (AMQ); prominent examples of AMQ-PDS are Bloom and Cuckoo …
Membership Queries (AMQ); prominent examples of AMQ-PDS are Bloom and Cuckoo …
Private queries on encrypted genomic data
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 …
was to demonstrate the feasibility of privacy-preserving queries on homomorphically …
Hashing, load balancing and multiple choice
U Wieder - … and Trends® in Theoretical Computer Science, 2017 - nowpublishers.com
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 …
that the allocation of items across buckets is as balanced as possible, and furthermore …