High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
Sai Sheshank Burraa b, Enrique Larraiac, Jesper Buus Nielsend, Peter Sebastian Nordholte, Claudio Orlandid, Emmanuela Orsinif g, Peter Schölld, Nigel Paul Smartf g✉
- aIndian Institute of Technology Guwahati, Guwahati, India
- bIndian Institute of Technology Guwahati, , Guwahati, India
- cScytl, Barcelona, Spain
- dAarhus University, Aarhus, Denmark
- eChainalysis Inc, Copenhagen, Denmark
- fimec-COSIC, KU Leuven, Leuven, Belgium
- g[Imec-COSIC KU Leuven, Leuven, Belgium]
- ✉Corresponding author
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
We present a unified view of the two-party and multi-party computation protocols based on oblivious transfer first outlined in Nielsen et al. (CRYPTO 2012) and Larraia et al. (CRYPTO 2014). We present a number of modifications and improvements to these earlier presentations, as well as full proofs of the entire protocol. Improvements include a unified pre-processing and online MAC methodology, mechanisms to pass between different MAC variants and fixing a minor bug in the protocol of Larraia et al. in relation to a selective failure attack. It also fixes a minor bug in Nielsen et al. resulting from using Jensen’s inequality in the wrong direction in an analysis.

