MPC ⇒ MPC with expected-time simulation

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

Statement

A protocol that securely computes $f$ with abort against $n-1$ corruptions (MPC) securely computes it with expected polynomial-time simulation: a simulator running in strict polynomial time runs in expected polynomial time — folklore.