Explore a conference talk on efficient constant round multi-party computation that combines BMR and SPDZ protocols. Delve into the intricacies of secure computation, examining two main approaches and their applications in both two-party and multi-party settings. Analyze the current state of the art, identify key challenges, and discover innovative solutions for shrinking garbling circuits and addressing mask inconsistencies. Gain insights into further optimizations, protocol overview, and estimated running times for this cutting-edge approach to secure multi-party computation.
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ
Overview
Syllabus
Intro
Multiparty Computation
The Setting in This Work
Two Main Approaches to (Efficient) Secure Computation
Two-Party Concretely Efficient
Multiparty Concretely Efficient
State of the Art
The Problem
[BMR 90] - Offline
Our Protocol
Shrinking the Garbling Circuit
Problem 2 - Inconsistency of Masks
Solution
Further Optimizations
Protocol Overview
Estimated Running Time
Conclusion
Taught by
TheIACR
Related Courses
-
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
-
Optimizing Authenticated Garbling for Faster Secure Two Party Computation
-
TinyKeys - A New Approach to Efficient Multi-Party Computation
-
Constant Round Asynchronous Multi Party Computation Based on One Way Functions
-
Fast Secure Computation for Small Population over the Internet
