A New Approach to Practical Active-Secure Two-Party Computation

Jesper Buus Nielsen; Peter Sebastian Nordholt; Claudio Orlandi; Sai Sheshank Burra

Paper 2011/091

A New Approach to Practical Active-Secure Two-Party Computation

Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra

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 garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle model. To get a practical protocol we introduce a number of novel techniques for relating the outputs and inputs of OTs in a larger construction. We also report on an implementation of this approach, that shows that our protocol is more efficient than any previous one: For big enough circuits, we can evaluate more than 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption (~34000 gates) takes 64 seconds, but when repeating the task 27 times it only takes less than 3 seconds per instance.

Metadata

Available format(s): PDF PS
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): orlandi @ cs au dk
History: 2012-02-14: last of 2 revisions; 2011-02-28: received; See all versions
Short URL: https://ia.cr/2011/091
License: CC BY

BibTeX

@misc{cryptoeprint:2011/091,
      author = {Jesper Buus Nielsen and Peter Sebastian Nordholt and Claudio Orlandi and Sai Sheshank Burra},
      title = {A New Approach to Practical Active-Secure Two-Party Computation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/091},
      year = {2011},
      url = {https://eprint.iacr.org/2011/091}
}