aqora

Oblivious Transfer and Linear Functions

Ivan Damgård, Serge Fehr, Louis Salvail +1 more

Lecture notes in computer scienceJan 1, 200619 citations

Distributed Protocols for Oblivious Transfer and Polynomial Evaluation

Aviad Ben Arie, Tamir Tassa

Lecture notes in computer scienceJan 1, 20241 citation

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE

Carsten Baum, Daniel E. Escudero, Alberto Pedrouzo-Ulloa +2 more

Lecture notes in computer scienceJan 1, 202020 citations

Efficiently from Semi-honest to Malicious OT via OLFE.

Jürg Wullschleger

A combiner securely implements a functionality out of a set implementations of another functionality from which some may be insecure. We present two efficient combiners for oblivious linear function evaluation (OLFE). The first is a constant-rate OLFE combiner in the semihonest model, the second combiner implements Rabin string oblivious transfer (RabinOT) from OLFE in the malicious model. As an application, we show a very efficient reductions in the malicious model of RabinOT over strings to one-out-of-two oblivious transfer over bits (OT) that is only secure in the semihonest model. For string of size ℓ = ω(k 2), our reductions uses only 4ℓ + o(ℓ) instances of OT, while previous results required Ω(ℓk 2). Our new reduction leads to an efficiency improvement for general multi-party computation (MPC) based on semi-honest OT, and makes it almost as efficient as MPC based on malicious OT. All reductions are unconditionally secure, black-box, universally composable and secure against adaptive adversaries. 1 1A combiner securely implements a functionality out of a set implementations of another functionality from which some may be insecure. We present two efficient combiners for oblivious linear function evaluation (OLFE). The first is a constant-rate OLFE combiner in the semihonest model, the second combiner implements Rabin string oblivious transfer (RabinOT) from OLFE in the malicious model. As an application, we show a very efficient reductions in the malicious model of RabinOT over strings to one-out-of-two oblivious transfer over bits (OT) that is only secure in the semihonest model. For string of size ℓ = ω(k 2), our reductions uses only 4ℓ + o(ℓ) instances of OT, while previous results required Ω(ℓk 2). Our new reduction leads to an efficiency improvement for general multi-party computation (MPC) based on semi-honest OT, and makes it almost as efficient as MPC based on malicious OT. All reductions are unconditionally secure, black-box, universally composable and secure against adaptive adversaries. 1 1

Jan 1, 20091 citation

TinyOLE

Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen +2 more

We introduce a new approach to actively secure two-party computation based on so-called oblivious linear function evaluation (OLE), a natural generalisation of oblivious transfer (OT) and a special case of the notion of oblivious polynomial evaluation introduced by Naor and Pinkas at STOC 1999. OLE works over a finite field F. In an OLE the sender inputs two field elements a ƒ F and b ƒ F, and the receiver inputs a field element x ∈ F and learns only ƒx) = ax + b. Our protocol can evaluate an arithmetic circuit over a finite field F given black-box access to OLE for F. The protocol is unconditionally secure and consumes only a constant number of OLEs per multiplication gate. An OLE over a field F of size O(2κ) be implemented with communication O(κ). This gives a protocol with communication complexity O(C κ) for large enough fields, where C is an arithmetic circuit computing the desired function.We introduce a new approach to actively secure two-party computation based on so-called oblivious linear function evaluation (OLE), a natural generalisation of oblivious transfer (OT) and a special case of the notion of oblivious polynomial evaluation introduced by Naor and Pinkas at STOC 1999. OLE works over a finite field F. In an OLE the sender inputs two field elements a ƒ F and b ƒ F, and the receiver inputs a field element x ∈ F and learns only ƒx) = ax + b. Our protocol can evaluate an arithmetic circuit over a finite field F given black-box access to OLE for F. The protocol is unconditionally secure and consumes only a constant number of OLEs per multiplication gate. An OLE over a field F of size O(2κ) be implemented with communication O(κ). This gives a protocol with communication complexity O(C κ) for large enough fields, where C is an arithmetic circuit computing the desired function.

ACM SIGSAC Conference on Computer and Communications Security (CCS)Oct 27, 201749 citations

Distributed oblivious function evaluation and its applications

Hongda Li, Xiong Yang, Dengguo Feng +1 more

Journal of Computer Science and TechnologyDec 1, 200410 citations

Oblivious Transfer and n-Variate Linear Function Evaluation

Related papers

Oblivious Transfer and n-Variate Linear Function Evaluation

Related papers