- This event has passed.
The Landscape of Exact Round Complexity in Secure Multi-Party Computation by Prof. Arpita Patra
April 16 @ 12:00 pm - 1:00 pm
Venue: Bharti501
Abstract: Secure Multi-Party Computation (MPC) is a central problem in cryptography, often regarded as its holy grail. It enables a group of mutually distrusting data owners to jointly compute a function over their private inputs, while revealing nothing beyond what is inherently implied by the output itself.
Round complexity is one of the most fundamental efficiency measures in MPC, capturing the minimal interaction required for secure computation. In this talk, I will present a high-level overview of the evolution of research on round complexity in MPC and place my own contributions within this evolving landscape.
Bio: Arpita Patra is a Professor of Computer Science at the Indian Institute of Science (IISc). Her research focuses on cryptography, with particular emphasis on the theoretical foundations and practical implementations of secure computation protocols. She has authored over 100 publications, and her work has been recognized through numerous honors, including the Prof. S. K. Chatterjee Award for Outstanding Woman Researcher/Industry Leader (IISc, 2023), the Google Privacy Research Faculty Award (2023), the J.P. Morgan Chase Faculty Award (2022), the SONY Faculty Innovation Award (2021), the Google Research Award (2020), the NASI Young Scientist Platinum Jubilee Award (2018), the SERB Women Excellence Award (2016), and the INAE Young Engineer Award (2016). She is affiliated with leading scientific academies, including the Indian Academy of Sciences (IAS), the Indian National Academy of Engineering (INAE), and The World Academy of Sciences (TWAS). She has coauthored two academic textbooks: Secure Multiparty Computation against Passive Adversaries (Springer, 2023) and Fault Tolerant Distributed Consensus in Synchronous Networks (Springer, 2025).