Efficient information theoretic multi-party computation from oblivious linear evaluation

Cianciullo, Louis, and Ghodosi, Hossein (2019) Efficient information theoretic multi-party computation from oblivious linear evaluation. In: Lecture Notes in Computer Science (11469) pp. 78-90. From: Information Security Theory and Practice, 12th IFIP WG 11.2 International Conference, WISTP 2018, 10 - 11 December 2018, Brussels, Belgium.

[img] PDF (Published version) - Published Version
Restricted to Repository staff only

View at Publisher Website: https://doi.org/10.1007/978-3-030-20074-...


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.

Item ID: 57724
Item Type: Conference Item (Research - E1)
ISBN: 978-3-030-20074-9
ISSN: 1611-3349
Related URLs:
Copyright Information: © IFIP International Federation for Information Processing 2019
Additional Information:

A version of this publication was included as Chapter 6 of the following PhD thesis: Cianciullo, Louis (2022) Investigation of unconditionally secure multi-party computation. PhD thesis, James Cook University, which is available Open Access in ResearchOnline@JCU. Please see the Related URLs for access.

Funders: Australian Government Research Training Program
Date Deposited: 18 Sep 2019 02:41
FoR Codes: 46 INFORMATION AND COMPUTING SCIENCES > 4613 Theory of computation > 461301 Coding, information theory and compression @ 70%
46 INFORMATION AND COMPUTING SCIENCES > 4604 Cybersecurity and privacy > 460401 Cryptography @ 30%
SEO Codes: 97 EXPANDING KNOWLEDGE > 970108 Expanding Knowledge in the Information and Computing Sciences @ 100%
Downloads: Total: 2
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page