Seminars

Many societal decisions on which we want collective input — from allocating a public budget to deciding how an automated decision rule should behave — have enormous combinatorial spaces of possible outcomes. The standard approach to eliciting public...

We study bitwise-optimal cryptographic primitives: functions in NC⁰ (where each output bit depends on only a constant number of input bits) that achieve exponential security, together with linear stretch for pseudorandom generators (PRGs) and linear...

Understanding the limits of list-decodability of Reed–Solomon (RS) codes has been one of the most important open problems in algebraic coding theory. In the RS list-decoding problem, we are given $n$ distinct points $a_1, \ldots, a_n$ in a finite...

Quantum computers will pose a major threat to the cryptography we use today. But quantum physics also lets us do things that are impossible classically. With quantum key distribution, for example, two people can share a secret key without a...

We present a deterministic $n$-party Byzantine broadcast protocol secure against $t

Joint work with Jovan Komatovic and Ling Ren. This result was found via extensive discussion and collaboration with ChatGPT dot.