Five-round 2PC ⇒ 2PC with expected-time simulation

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

Statement

A plain-model protocol of five rounds, one party sending per round, that securely computes a two-party functionality $f$ with abort against a malicious adversary corrupting either party, with a black-box simulator running in expected polynomial time (five-round 2PC), securely computes $f$ with abort with a simulator running in expected polynomial time (2PC with expected polynomial-time simulation): for each efficient $\mathcal{A}$, the black-box simulator run with $\mathcal{A}$ as its oracle is such a simulator for $\mathcal{A}$ — folklore.