How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties require each pair of parties to engage in a single OT for each gate in the circuit being evaluated. Since implementing OT typically requires expensive public-key operations (alternatively, expensive setup or physical infrastructure), minimizing the number of OTs is a highly desirable goal. In this work we initiate a study of this problem in both an information-theoretic and a computational setting and obtain the following results.

• Type: Conference
• Year: 2007
• Where: CRYPTO
• Authors: Danny Harnik, Yuval Ishai, Eyal Kushilevitz
• Keywords: Arbitrary Function, CRYPTO 2007, Cryptology, Secure Multiparty Computation, Single Ot