Efficient Information Theoretic Multi-party Computation from Oblivious Linear Evaluation - Information Security Theory and Practice Access content directly
Conference Papers Year : 2019

Efficient Information Theoretic Multi-party Computation from Oblivious Linear Evaluation

Louis Cianciullo
  • Function : Author
  • PersonId : 1054587
Hossein Ghodosi
  • Function : Author
  • PersonId : 1054588

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
Fichier principal
Vignette du fichier
484602_1_En_7_Chapter.pdf (313.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02294594 , version 1 (23-09-2019)

Licence

Attribution

Identifiers

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⟩
47 View
32 Download

Altmetric

Share

Gmail Facebook X LinkedIn More