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 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… Read More »The Landscape of Exact Round Complexity in Secure Multi-Party Computation by Prof. Arpita Patra
