Jul 30, 2023 · Abstract. We give the first construction of a fully black-box round-optimal secure multiparty computation (MPC) protocol in the plain model.

Aug 9, 2023 · A two-round client-server MPC protocol that is secure against a malicious adversary that corrupts an arbitrary number of clients and a constant ...

Aug 20, 2023 · Our protocol makes black-box use of a sub-exponentially secure two-message statistical sender private oblivious transfer (SSP-OT), which in turn ...

Nov 6, 2021 · - 4-round ``pairwise MPC'' in the plain model. This round-optimal protocol enables each ordered pair of parties to compute a function of both ...

Abstract. We give the first construction of a (fully) black-box round-optimal secure multiparty computation protocol in the plain model.

round optimality in the plain model if there exists a 4-round black-box oblivious transfer protocol ... round MPC constructions based on the black-box use of any ...

We construct a four round secure multip arty computation (MPC) protocol in the plain model that achieves security against any dishonest majority.

A three-round multiparty secure computation protocol in the random oracle model secure against malicious adversaries that is based on the black-box use of two- ...

Nov 29, 2023 · This work considers the natural question of characterizing broadcast optimal MPC in the plain model where no set-up is assumed. We focus on 4- ...

Hazay, C., Venkitasubramaniam, M.: Round-optimal fully black-box zero-knowledge arguments from one-way permutations. In: TCC 2018. · Khurana, D., Sahai, A.: Two- ...