Explore a conference talk on secure two-party computation presented at Eurocrypt 2017. Delve into the implementation of semi-honest 2PC using garbled circuits, input-recovery-based cut-and-choose techniques, and common issues in the field. Examine input recovery methods, selective failure attacks, and the cost of p-probe matrices. Learn about the speakers' final construction and its comparison to prior work. Analyze experimental results and subsequent developments in the area of faster secure two-party computation in the single execution setting.
Faster Secure Two Party Computation in the Single Execution Setting
Overview
Syllabus
Intro
2PC Implementation
Semi-honest 2PC using Garbled Circuits
Input-Recovery-Based Cut-and- choose
Common Issues
Input Recovery
Selective Failure Attack
Cost of p-probe Matrix
Smaller Probe Matrix
Our Final Construction
Comparison to Prior Work
Input Consistency
Experimental Results
Subsequent Work
Taught by
TheIACR
