Efficient Information Theoretic Multi-party Computation from Oblivious Linear Evaluation
Résumé
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
Domaines
Informatique [cs]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...
Hal Ifip : Connectez-vous pour contacter le contributeur
https://hal.science/hal-02294594
Soumis le : lundi 23 septembre 2019-15:49:13
Dernière modification le : lundi 23 septembre 2019-15:52:12
Archivage à long terme le : dimanche 9 février 2020-08:32:58
Dates et versions
Licence
Identifiants
- HAL Id : hal-02294594 , version 1
- DOI : 10.1007/978-3-030-20074-9_7
Citer
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
69
Consultations
58
Téléchargements