Cryptology ePrint Archive: Report 2018/1227

Efficient Information Theoretic Multi-Party Computation from Oblivious Linear Evaluation

Louis Cianciullo and Hossein Ghodosi

Abstract: Oblivious linear evaluation (OLE) is a two party protocol that allows a receiver to compute an evaluation of a sender's private, degree $1$ polynomial, without letting the sender learn the evaluation point. OLE is a special case of oblivious polynomial evaluation (OPE) which was first introduced by Naor and Pinkas in 1999. In this article we utilise OLE for the purpose of computing multiplication in multi-party computation (MPC).

MPC allows a set of $n$ mutually distrustful parties to privately compute any given function across their private inputs, even if up to $t<n$ of these participants are corrupted and controlled by an external adversary. In terms of efficiency and communication complexity, multiplication in MPC has always been a large bottleneck. The typical method employed by most current protocols has been to utilise Beaver's method, which relies on some precomputed information. In this paper we introduce an OLE-based MPC protocol which also relies on some precomputed information.

Our proposed protocol has a more efficient communication complexity than Beaver's protocol by a multiplicative factor of $t$. Furthermore, to compute a share to a multiplication, a participant in our protocol need only communicate with one other participant; unlike Beaver's protocol which requires a participant to contact at least $t$ other participants.

Category / Keywords: cryptographic protocols / information theoretic, multi-party computation, oblivious linear evaluation

Original Publication (with minor differences): The 12th WISTP International Conference on Information Security Theory and Practice (WISTP'2018)

Date: received 21 Dec 2018

Contact author: louis cianciullo at my jcu edu au

Available format(s): PDF | BibTeX Citation

Version: 20181230:125514 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]