The Landscape of Exact Round Complexity in Secure Multi-Party Computation by Prof. Arpita Patra
Bharti 501 IIT Campus, Hauz Khas, New DelhiVenue: 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… Read More »The Landscape of Exact Round Complexity in Secure Multi-Party Computation by Prof. Arpita Patra
