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 …
A Bossuat, R Bost, PA Fouque, B Minaud… - Advances in Cryptology …, 2021 - Springer
Abstract Searchable Symmetric Encryption (SSE) enables a client to outsource a database to an untrusted server, while retaining the ability to securely search the data. The …
In dynamic load balancing, we wish to allocate a set of clients (balls) to a set of servers (bins) with the goal of minimizing the maximum load of any server and also minimizing the …
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 …
M Naor, E Yogev - Annual Cryptology Conference, 2015 - Springer
Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and/or correctness are analyzed using probabilistic tools …
M Pǎtraşcu, M Thorup - ACM Transactions on Algorithms (TALG), 2015 - dl.acm.org
We show that linear probing requires 5-independent hash functions for expected constant- time performance, matching an upper bound of Pagh et al.[2009]. More precisely, we …
A searchable symmetric encryption (SSE) scheme enables a client to store data on an untrusted server while supporting keyword searches in a secure manner. Recent …
M Naor, Y Eylon - ACM Transactions on Algorithms (TALG), 2019 - dl.acm.org
Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and correctness are analyzed using probabilistic tools under …
D Eppstein - arXiv preprint arXiv:1604.06067, 2016 - arxiv.org
The cuckoo filter data structure of Fan, Andersen, Kaminsky, and Mitzenmacher (CoNEXT 2014) performs the same approximate set operations as a Bloom filter in less memory, with …