Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Explore a conference talk on optimizing semi-honest secure multiparty computation for internet applications. Delve into the research presented by Aner Ben-Efraim, Yehuda Lindell, and Eran Omri at the 23rd ACM Conference on Computer and Communications Security (CCS 2016). Learn about the two main paradigms for secure computation, multiparty concrete efficiency developments over the last decade, and the authors' results. Gain insights into Yao's Garbled Circuit, the BMR Garbled Circuit, and the BMR Protocol's round complexity. Understand the online phase of evaluating BMR circuits and explore honest minority OT-based and BGW-based protocols. Examine experimentation details, including performance in high and low latency scenarios for total and online time. Conclude with open questions and future directions in the field of secure multiparty computation optimization.

Intro
Secure Multiparty Computation
Two Main Paradigms for Secure Computation
Multiparty Concrete Efficiency - The Last Decade
Our Results, Outline
Background - Yao's Garbled Circuit
The BMR Garbled Circuit
Point and Permute
BMR Protocol - Round Complexity
Online Phase - Evaluating BMR Circuit
Honest Minority - OT-Based Protocol
BGW-Based Protocol
Experimentation Details
High Latency - Total Time
High Latency - Online Time
Low Latency - Online Time
Conclusions and Open Questions