Two-Round Multiparty Secure Computation from Minimal Assumptions

Explore a groundbreaking paper on secure multiparty computation presented at Eurocrypt 2018. Delve into the work of Sanjam Garg and Akshayaram Srinivasan as they introduce a two-round protocol for secure multiparty computation based on minimal assumptions. Learn about the foundations of secure two-party and multiparty computation, round compression techniques, and the innovative toy protocol. Understand the high-level idea behind the two-round protocol, including the implementation of garbled circuits and oblivious transfer. Examine the application of this protocol to toy functions and its extension to general cases. Gain insights into the latest advancements in cryptographic protocols and their potential impact on secure computation.

Intro
Secure Two-Party Computation
Secure Multiparty Computation
What is known?
Round Compression
Toy protocol
Two-Round Protocol: High level Idea
How do the garbled circuits implement rounds?
Oblivious Transfer
Two-Round Protocol for Toy Function
Functions computed by Garbled Circuits
General Case
Conclusion