The Communication Complexity Landscape of Information-Theoretic MPC

Explore the evolution and current state of communication complexity in information-theoretic secure multi-party computation through this 58-minute conference talk by Arpita Patra from the Indian Institute of Science at the Simons Institute. Delve into the fundamental concepts of Secure Multi-party Computation (MPC), which enables multiple data owners to collaboratively compute results while maintaining complete privacy of their individual inputs, revealing only what can be derived from the final computation outcome. Examine how communication complexity serves as a critical measure for evaluating MPC protocols with information-theoretic security guarantees. Gain insights into the historical progression of communication complexity research in this field and discover key contributions that have shaped our understanding of efficient secure computation protocols over the years.