We introduce Oblivious Twocast (Oblivious Cast - OC - for short), a natural generalization of Oblivious Transfer to the three-party case, and show that this primitive is complete for n/2-resilient multiparty computation. Namely, every (n-input n-output) n/2-resilient function can be computed given black-box access to OC. We also show that no two-party primitive, such as OT, can be complete; thus, OC is minimal in the number of players.

---