Dissertation Talk: Towards Secure Computation with Optimal Complexity
Seminar: Dissertation Talk: CS | May 6 | 2-3 p.m. | 606 Soda Hall
Secure computation enables a set of mutually distrusting parties to collaboratively compute a public function over their private data while keeping those data private. A central question in the cryptography community, that has been studied for decades, is whether secure computation protocols can be efficient enough to serve for its countless applications. In this talk, I will present my efforts towards secure computation with optimal computation, communication, and round complexity in both theory and practice.