1 research outputs found
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
We show new constructions of semi-honest and malicious two-round multiparty secure computation
protocols using only (a fixed) invocations of a two-round oblivious
transfer protocol (which use expensive public-key operations) and cheaper one-way function calls, where is the security parameter, is the number of parties, and is the circuit being computed. All previously known two-round multiparty secure computation protocols required expensive public-key operations