Abstract

Secure Multi-party Computation (MPC) is the standard-bearer and holy-grail problem in Cryptography that permits a collection of data-owners to compute a collaborative result, without any of them gaining any knowledge about the data provided by the other, except what is derivable from the result of the computation. Communication complexity is one of the most prominent complexity measures of MPC with information-theoretic security. In this talk, I will draw a high-level picture of how the communication complexity study progressed over the years and my contributions to this area.