misc: multi-input secure two-party computation

Secure multi-party computation (mpc) allows a group of parties to compute a function on their private inputs securely. classic mpc protocols for two parties use either yao’s garbled circuit (gc) or the goldreich-micali-wigderson (gmw) protocol. in this paper, we propose misc, a multi-input secure computation protocol, by combining gc and gmw in a novel way. misc can evaluate multi-input and gates, which can reduce the round complexity. moreover, misc reduces the communication overhead by 1.7x and 2.4x for 2-input and by 2x and 2.8x for 4-input and gates compared to the state-of-the-art gmw-style and gc-style protocols, respectively. in order to use the misc efficiently in different applications, we redesign common building block with multi-input and gates such as equality checking, maxpool, comparison, and argmax/argmin. results on privacy-preserving applications, e.g., circuit-based private set intersection (psi) and private machine learning (cnn inference) show that compared to gmw, misc improves the total communication overhead by 3x and the total run time by 1.5x.