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

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

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

Sai Sheshank Burra
, Enrique Larraia
, Jesper Buus Nielsen
, Peter Sebastian Nordholt
, Claudio Orlandi
, Emmanuela Orsini
, Peter Scholl
, Nigel P. Smart^*

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

16 Citations (Scopus)

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.

Original language	English
Article number	34
Journal	Journal of Cryptology
Volume	34
Issue	3
Number of pages	87
ISSN	0933-2790
DOIs	https://doi.org/10.1007/s00145-021-09403-1
Publication status	Published - Jul 2021

Keywords

Multi-party computation
Oblivious transfer
Secret sharing

Access to Document

10.1007/s00145-021-09403-1

https://eprint.iacr.org/2015/472.pdfLicence: CC BY

Library access?

Check availability with the Royal Danish Library

Cite this

@article{42836a268a274f329d968a5e2331a937,

title = "High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer",

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{\textquoteright}s inequality in the wrong direction in an analysis.",

keywords = "Multi-party computation, Oblivious transfer, Secret sharing",

author = "Burra, \{Sai Sheshank\} and Enrique Larraia and Nielsen, \{Jesper Buus\} and Nordholt, \{Peter Sebastian\} and Claudio Orlandi and Emmanuela Orsini and Peter Scholl and Smart, \{Nigel P.\}",

note = "Publisher Copyright: {\textcopyright} 2021, International Association for Cryptologic Research.",

year = "2021",

month = jul,

doi = "10.1007/s00145-021-09403-1",

language = "English",

volume = "34",

journal = "Journal of Cryptology",

issn = "0933-2790",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer

AU - Burra, Sai Sheshank

AU - Larraia, Enrique

AU - Nielsen, Jesper Buus

AU - Nordholt, Peter Sebastian

AU - Orlandi, Claudio

AU - Orsini, Emmanuela

AU - Scholl, Peter

AU - Smart, Nigel P.

PY - 2021/7

Y1 - 2021/7

N2 - 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.

AB - 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.

KW - Multi-party computation

KW - Oblivious transfer

KW - Secret sharing

UR - https://www.scopus.com/pages/publications/85109080750

U2 - 10.1007/s00145-021-09403-1

DO - 10.1007/s00145-021-09403-1

M3 - Journal article

AN - SCOPUS:85109080750

SN - 0933-2790

VL - 34

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 3

M1 - 34

ER -

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

Abstract

Keywords

Access to Document

Library access?

Other files and links

Fingerprint

Cite this