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
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02294594
Contributor : Hal Ifip <>
Submitted on : Monday, September 23, 2019 - 3:49:13 PM
Last modification on : Monday, September 23, 2019 - 3:52:12 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

9