Fast Secure Computation for Small Population over the Internet

Explore efficient, constant-round 3-party and 4-party protocols for secure multiparty computation in this 21-minute conference talk. Delve into the honest-majority setting, focusing on strong security notions of fairness and guaranteed output delivery. Learn about garbled circuits, three-party protocols, and fairness mechanisms. Examine the challenges, efficiency considerations, and open questions in the field of secure computation for small populations over the internet. Gain insights into the latest advancements in cryptographic protocols presented at the Association for Computing Machinery (ACM) conference.

Introduction
Secure MultiParty Computation
Garbled Circuit
ThreeParty Protocol
ThreeParty Fairness
Summary
Challenges
Efficiency
Open Question