2PC ⇒ Malicious OPE
Statement
For every finite field with -bit elements and efficient operations and every polynomial degree bound , let , with given by its coefficients and an input that encodes no element of , respectively of , replaced by the zero polynomial, respectively by . A protocol that securely computes with abort against a malicious adversary corrupting one party, which exists when 2PC is achieved, is an OPE with malicious security — folklore.
Sketch
, with the replacement of inadmissible inputs, is a polynomial-time functionality, and the coefficient encoding admits only polynomials of degree at most , so malicious security of the OPE is security with abort of the general protocol for — standard.
Notes
- Run on a semi-honest 2PC protocol, the same construction gives semi-honest secure OPE (semi-honest 2PC ⇒ OPE) — folklore.