## CryptoDB

### Paper: High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer

Authors: Sai Sheshank Burra Enrique Larraia Jesper Buus Nielsen Peter Sebastian Nordholt Claudio Orlandi Emmanuela Orsini Peter Scholl Nigel P. Smart DOI: 10.1007/s00145-021-09403-1 Search ePrint Search Google 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.
##### BibTeX
@article{jofc-2021-31759,
title={High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer},
journal={Journal of Cryptology},
publisher={Springer},
volume={34},
doi={10.1007/s00145-021-09403-1},
author={Sai Sheshank Burra and Enrique Larraia and Jesper Buus Nielsen and Peter Sebastian Nordholt and Claudio Orlandi and Emmanuela Orsini and Peter Scholl and Nigel P. Smart},
year=2021
}