Semi-honest 2PC ⇒ OPE

Fully-black-box reduction · standard model · folklore · security loss: none

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