Semi-honest 2PC ⇒ OPE
Statement
For every finite field with -bit elements and efficient operations and every polynomial degree bound , a protocol that securely computes against semi-honest adversaries, with given by its coefficients, is a semi-honest secure OPE; such a protocol exists when semi-honest 2PC is achieved — folklore.
Sketch
is computed from the coefficients and by multiplications and additions in (Horner’s rule), so is a polynomial-time functionality and has a protocol secure against semi-honest adversaries; for each corrupted party the OPE semi-honest game is the semi-honest 2PC game for — standard.
Notes
- With the protocol for secure with abort against a malicious adversary corrupting one party (2PC), the same construction gives OPE with malicious security (2PC ⇒ malicious OPE) — folklore.
- Semi-honest OT gives semi-honest secure computation of every functionality (semi-honest OT ⇒ semi-honest MPC) — GMW87, Gol04 — and conversely semi-honest OPE gives semi-honest OT (OPE ⇒ OT) — folklore.