Главная
Study mode:
on
1
Intro
2
2PC Implementation
3
Semi-honest 2PC using Garbled Circuits
4
Input-Recovery-Based Cut-and- choose
5
Common Issues
6
Input Recovery
7
Selective Failure Attack
8
Cost of p-probe Matrix
9
Smaller Probe Matrix
10
Our Final Construction
11
Comparison to Prior Work
12
Input Consistency
13
Experimental Results
14
Subsequent Work
Description:
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

TheIACR
Add to list
0:00 / 0:00