One Server for the Price of Two: Simple and Fast {Single-Server} Private Information Retrieval
We present SimplePIR, the fastest single-server private information retrieval scheme known
to date. SimplePIR's security holds under the learning-with-errors assumption. To answer a …
to date. SimplePIR's security holds under the learning-with-errors assumption. To answer a …
A model for learned bloom filters and optimizing by sandwiching
M Mitzenmacher - Advances in Neural Information …, 2018 - proceedings.neurips.cc
Recent work has suggested enhancing Bloom filters by using a pre-filter, based on applying
machine learning to determine a function that models the data set the Bloom filter is meant to …
machine learning to determine a function that models the data set the Bloom filter is meant to …
A framework for adversarially robust streaming algorithms
We investigate the adversarial robustness of streaming algorithms. In this context, an
algorithm is considered robust if its performance guarantees hold even if the stream is …
algorithm is considered robust if its performance guarantees hold even if the stream is …
Adversarial laws of large numbers and optimal regret in online classification
Laws of large numbers guarantee that given a large enough sample from some population,
the measure of any fixed sub-population is well-estimated by its frequency in the sample. We …
the measure of any fixed sub-population is well-estimated by its frequency in the sample. We …
Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
Forward secrecy is considered an essential design goal of modern key establishment (KE)
protocols, such as TLS 1.3, for example. Furthermore, efficiency considerations such as zero …
protocols, such as TLS 1.3, for example. Furthermore, efficiency considerations such as zero …
Efficient multi-party private set intersection against malicious adversaries
Private set intersection (PSI) enables parties to compute the intersection of their inputs
without leaking any additional information. Recently, there have been significant advances …
without leaking any additional information. Recently, there have been significant advances …
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
We investigate the best-possible (asymptotic) efficiency of functional encryption (FE) and
attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing …
attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing …
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 …
Probabilistic data structures in adversarial environments
D Clayton, C Patton, T Shrimpton - Proceedings of the 2019 ACM …, 2019 - dl.acm.org
Probabilistic data structures use space-efficient representations of data in order to
(approximately) respond to queries about the data. Traditionally, these structures are …
(approximately) respond to queries about the data. Traditionally, these structures are …
Pseudorandom functions: Three decades later
A Bogdanov, A Rosen - Tutorials on the Foundations of Cryptography …, 2017 - Springer
Abstract In 1984, Goldreich, Goldwasser and Micali formalized the concept of
pseudorandom functions and proposed a construction based on any length-doubling …
pseudorandom functions and proposed a construction based on any length-doubling …