1 research outputs found

    Two-Round Multiparty Secure Computation Minimizing Public Key Operations

    Get PDF
    We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) poly(n,λ)\mathsf{poly}(n,\lambda) invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and poly(λ,∣C∣)\mathsf{poly}(\lambda, |C|) cheaper one-way function calls, where λ\lambda is the security parameter, nn is the number of parties, and CC is the circuit being computed. All previously known two-round multiparty secure computation protocols required poly(λ,∣C∣)\mathsf{poly}(\lambda,|C|) expensive public-key operations
    corecore