Talk by Aner Moshe Ben Efraim

Info about event

Time

Wednesday 20 June 2018,  at 13:00 - 14:00

Location

Nygaard 295

Title: On Multiparty Garbling of Arithmetic Circuits

Abstract: 

Secure multiparty computation enable a set of (mutually distrusting) parties to carry out a joint computation on private inputs correctly and without revealing anything but the output. In recent years, there has been a huge amount of work dedicated to providing secure multiparty computation protocols that can be efficiently run in practice. In particular, there has also been a growing interest in multiparty protocols following the multiparty garbling paradigm, introduced by Beaver et al. (STOC ’90), due to their performance in high latency networks, such as the internet.

Prior to this work, these multiparty garbling protocols were solely for Boolean circuits, and arithmetic garbled circuits were discussed only in the 2-party setting. In this work, we initiate a study of garbled circuits that contain both Boolean and arithmetic gates in securemultiparty computation. In particular, we incorporate the 2-party garbling gadgets for arithmetic circuits recently presented by Ball et al. (ACM CCS 2016) into the multiparty garbling paradigm, and also present new garbling gadgets. Using mixed Boolean-arithmetic circuits allows more efficient secure computation of functions that naturally combine Boolean and arithmetic computations.