A New Approach to Practical Active-Secure Two-Party Computation
Claudio Orlandi, BIU
Abstract: We propose a new approach to practical two-party computation
secure against an active adversary. All prior practical protocols were
based on Yao's protocol. We use an OT-based approach and get
efficiency via OT extension. To get a practical protocol we introduce
a number of novel techniques for relating the outputs and inputs of
OTs in a larger computation. We also report on an implementation of
this approach, that shows that our protocol is more efficient than any
previous one: As an example, evaluating a Boolean circuit of
$\sim34000$ gates (oblivious AES encryption) takes less than $2$
seconds using our protocol.
This is joint work with Jesper Buus Nielsen, Peter Sebastian Nordholt
and Sai Sheshank