Abstract

Modern cryptographic techniques -- such as secure multiparty computation and zero-knowledge proofs -- enable secure computation over private data while ensuring the integrity of the computation. In this talk, I will highlight some recent advances in designing efficient protocols for these primitives, with a particular focus on approaches that achieve sublinear communication. I will conclude with some interesting open problems in this area.