Two Main Approaches to (Efficient) Secure Computation
5
Two-Party Concretely Efficient
6
Multiparty Concretely Efficient
7
State of the Art
8
The Problem
9
[BMR 90] - Offline
10
Our Protocol
11
Shrinking the Garbling Circuit
12
Problem 2 - Inconsistency of Masks
13
Solution
14
Further Optimizations
15
Protocol Overview
16
Estimated Running Time
17
Conclusion
Description:
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