Abstract. Protocols for generic secure multi-party computation (MPC) generally come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which protocol to use can have a significant impact on efficiency. The magnitude of the effect, however, has never been quantified. With this in mind, we implement the MPC protocol of Goldreich, Micali, and Wigderson [13] , which uses a boolean representation and is secure against a semi-honest adversary corrupting any number of parties. We then consider applications of secure MPC in on-line marketplaces, where customers select resources advertised by providers and it is desired to ensure privacy to the extent possible. Problems here are more naturally formulated in terms of boolean circuits, and we study the performance of our MPC implementation relative to existing ones that use an arithmetic-circuit representation. Our protocol easily handles tens of customers/providers and thousands of resources, and outperforms existing implementations including FairplayMP [3], VIFF [11] , and SEPIA [7] .
Other work compared quantitatively secure multiparty computation with respect to the function being a boolean circuit and the function being an arithmetic circuit over a large field REF .
Secure multiparty computation of boolean circuits with applications to privacy in on-line marketplaces
In Cryptology ePrint Archive, Report 2011/257, 2011. Available at http://eprint.iacr.org/2011/257
Computer Science