Sep 20, 2021 · We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup.

We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup.

Nov 3, 2021 · Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. 78 views · 2 years ago ...more ...

We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup.

The first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup is proposed, ...

Abstract. We propose the first maliciously secure multi-party compu- tation (MPC) protocol for general functionalities in two rounds, without.

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation ... Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. Yuval ...

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. Agarwal A.;Bartusek J.;Goyal V.;Khurana D.;Malavolta G. 2021. Scheda breve; Scheda ...

Since the standard notion of polynomial simulation is un-achievable in less than four rounds, we focus on security with super-polynomial-time simulation (SPS).

Two-round maliciously secure computation with super-polynomial simulation. In Theory of Cryptography - 19th International Conference, TCC, pages 654–685 ...