Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier

Explore a groundbreaking presentation on optimized honest-majority secure multiparty computation (MPC) for malicious adversaries, delivered at the 2017 IEEE Symposium on Security & Privacy. Delve into Ariel Nof's innovative techniques that shatter the 1 billion-gate per second barrier, significantly improving efficiency in the presence of malicious adversaries. Discover how the speaker reduces bandwidth consumption from 10 bits to 7 bits per AND gate and implements cache-efficient shuffling methods for cut-and-choose protocols. Examine the combinatorial analysis bounding adversary cheating probability and learn about the impressive implementation results, including secure computation of 212,000 AES encryptions per second. Gain insights into the potential for high-throughput secure computation in the face of malicious adversaries through this 19-minute talk covering introduction, setting, malicious protocol, multiplication table, implementation details, benchmarking, size optimization, and summary.

Introduction
Setting
Malicious Protocol
Multiplication Table
How does it work
Benchmarking
Size Optimization
Summary