High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

54 Pages·2017·2.9 MB·English

High-Throughput Secure Three-Party
Computation for Malicious
Adversaries and an Honest Majority
Jun Furukawa*, Yehuda Lindell**, Ariel Nof** and Or Weinstein**
*NEC corporation, Israel **Bar-Ilan University, Israel
Eurocrypt 2017
Secure Three-Party Computation with an Honest Majority
𝑥
1 𝑥
2
𝑓(𝑥 , 𝑥 , 𝑥 )
1 2 3
𝑥
3
Secure Three-Party Computation with an Honest Majority
𝑥
1 𝑥
2
𝑓(𝑥 , 𝑥 , 𝑥 )
1 2 3
𝑥
3
Secure Three-Party Computation with an Honest Majority
𝑥
1 𝑥
2
𝑓(𝑥 , 𝑥 , 𝑥 )
1 2 3
𝑥
3
• Functionality is represented
by a Boolean circuit
• Security with abort
High-Throughput
Secure Three-Party Computation
with an Honest Majority
High-Throughput
Secure Three-Party Computation
with an Honest Majority
𝑡
𝑠𝑡𝑎𝑟𝑡 f 𝑡
𝑒𝑛𝑑
How much time it takes to
compute a function?
High-Throughput
Secure Three-Party Computation
with an Honest Majority
𝑡
𝑠𝑡𝑎𝑟𝑡 f 𝑡
𝑒𝑛𝑑
How much time it takes to
compute a function?
Latency
High-Throughput
Secure Three-Party Computation
with an Honest Majority
1 𝑠𝑒𝑐
f
f
f
𝑡 f
𝑠𝑡𝑎𝑟𝑡 f 𝑡
𝑒𝑛𝑑 f
f
f
f
f
How much time it takes to How many functions can we
compute a function? compute in one sec?
Latency
High-Throughput
Secure Three-Party Computation
with an Honest Majority
1 𝑠𝑒𝑐
f
f
f
𝑡 f
𝑠𝑡𝑎𝑟𝑡 f 𝑡
𝑒𝑛𝑑 f
f
f
f
f
How much time it takes to How many functions can we
compute a function? compute in one sec?
Latency Throughput
Low Latency High-Throughput
VS.
Low Latency High-Throughput