Efficient Information Theoretic Multi-party Computation from Oblivious Linear Evaluation
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
Domains
Computer Science [cs]Origin | Files produced by the author(s) |
---|
Loading...
Hal Ifip : Connect in order to contact the contributor
https://hal.science/hal-02294594
Submitted on : Monday, September 23, 2019-3:49:13 PM
Last modification on : Monday, September 23, 2019-3:52:12 PM
Long-term archiving on: Sunday, February 9, 2020-8:32:58 AM
Dates and versions
Licence
Identifiers
- HAL Id : hal-02294594 , version 1
- DOI : 10.1007/978-3-030-20074-9_7
Cite
Louis Cianciullo, Hossein Ghodosi. Efficient Information Theoretic Multi-party Computation from Oblivious Linear Evaluation. 12th IFIP International Conference on Information Security Theory and Practice (WISTP), Dec 2018, Brussels, Belgium. pp.78-90, ⟨10.1007/978-3-030-20074-9_7⟩. ⟨hal-02294594⟩
Collections
59
View
43
Download