11
TWO-Party Improvements  Circuits generated pseudo randomly Only hashes of circuits sent over Seeds are revealed for opened circuits Reduced OT communication Only first few steps of OTs are executed initially Receiver committed to his inputs Sufficient for simulation to go through

18
Main Modifications Inputs not embedded in garbled circuit Opening a circuit does not reveal inputs Garbling done using a semi-honest SFE Parties commit to their random coins Run multiple semi-honest sessions Cheating is detected through cut-and- choose

23
Efficiency Measures Communication Number of bits exchanged Rounds Number of rounds of interaction Computation Local work by each party Practical measures Black-box use of underlying primitives Avoiding generic ZK proofs Efficiently implementable primitives