Explore a groundbreaking paper on black-box concurrent secure computation presented at Eurocrypt 2018 by researchers Sanjam Garg, Susumu Kiyoshima, and Omkant Pandey. Delve into their innovative approach to addressing challenges in secure multi-party computation, focusing on concurrent settings and black-box constructions. Gain insights into the latest advancements in cryptographic protocols and their potential applications in privacy-preserving distributed computing.
A New Approach to Black-Box Concurrent Secure Computation
Overview
Syllabus
A New Approach to Black-Box Concurrent Secure Computation
Taught by
TheIACR
Related Courses
-
Secure Computation: Part II
-
The Exact Round Complexity of Secure Computation
-
Concurrently Secure Computation in Constant Rounds
-
On the Exact Round Complexity of Self Composable Two Party Computation
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
-
On the Exact Round Complexity of Secure Three Party Computation
