Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

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.