Network-oblivious Transfer: Infrastructure for Secure Multiparty Computation

Adam Sealfon, Massachusetts Institute of Technology

We study the possibility of implementing an infrastructure for secure multiparty computation (MPC) with the goal of improving its concrete efficiency. We propose an infrastructure based on oblivious transfer (OT), which would consist of OT channels between some pairs of parties in the network. We devise information-theoretically secure protocols that allow additional pairs of parties to establish secure OT correlations using other parties' help in the network in the presence of a dishonest majority. Our main technical contribution is an upper bound that matches a lower bound of Harnik, Ishai and Kushilevitz (Crypto 2007), who studied the number of OT channels necessary and sufficient for MPC. In particular, we characterize which n-party OT graphs G allow t-secure computation of OT correlations between all pairs of parties, showing that this is possible if and only if the complement of G does not contain the complete bipartite graph K_{n-t,n-t} as a subgraph.

Abstract Author(s): Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon