We study the space complexity of the two related fields of differential privacy and adaptive
data analysis. Specifically, Under standard cryptographic assumptions, we show that there …

In this work, we show, for the well-studied problem of learning parity under noise, where a
learner tries to learn $ x=(x_1,\ldots, x_n)\in\{0, 1\}^ n $ from a stream of random linear …

In this work, we establish lower-bounds against memory bounded algorithms for
distinguishing between natural pairs of related distributions from samples that arrive in a …

We give the first examples of public-key encryption schemes which can be proven to
achieve multi-challenge, multi-user CCA security via reductions that are tight in time …

This paper continues the study of memory-tight reductions (Auerbach et al., CRYPTO'17).
These are reductions that only incur minimal memory costs over those of the original …

The primary objective of provable security is to characterize, as precisely as possible, the
resources an attacker needs to compromise the security of a cryptographic system. While the …