Explore the intricacies of secure computation in this 24-minute Eurocrypt 2016 conference talk presented by Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, and Antigoni Polychroniadou. Delve into the research findings that address the exact round complexity of secure computation, a crucial aspect of cryptographic protocols. Gain insights into the latest advancements in the field and understand the implications for designing efficient and secure multi-party computation systems.
Overview
Syllabus
The Exact Round Complexity of Secure Computation
Taught by
TheIACR
Related Courses
-
On the Exact Round Complexity of Secure Three Party Computation
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
-
A New Approach to Black-Box Concurrent Secure Computation
-
Concurrently Secure Computation in Constant Rounds
-
On the Exact Round Complexity of Self Composable Two Party Computation
-
MPC Round Efficiency - Session 1
