Two-server Private Information Retrieval achieves arbitrarily small polynomial communication, but relies on a strong non-collusion assumption that
is difficult to justify in practice.

We introduce a new variant of two-server PIR in which one server acts as a standard *compute* server, while the other is a restricted *retrieval-only* server. The ... more >>>

We continue the study of half-duplex communication complexity, a model introduced in [HIMS18] and further studied in [DISSU21], in which each player can either send a bit or listen in each round, similarly to communication over a walkie-talkie.
We prove improved upper bounds for the Inner Product function in the ... more >>>

We show that one-way functions suffice for constructing very efficient argument systems for proving the correctness of bounded-space computations. Taking $\kappa$ to be a cryptographic security parameter and $n$ to be the input length, our argument system applies to general computations running in time $T$ and space $S$. The protocol ... more >>>