Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions

ePrint Report: Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions

Anders Dalskov, Daniel Escudero, Ariel Nof

We revisit the question of the overhead to achieve full security (i.e., guaranteed output delivery) in secure multiparty computation (MPC). Recent works have closed the gap between full security and semi-honest security, by introducing protocols where the parties first compute the circuit using a semi-honest protocol and then run a verification step with sublinear communication in the circuit …

computation daniel delivery eprint report extensions gap mpc question report rings secure multiparty computation security