Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries. (arXiv:2208.06223v1 [cs.CR])

In this work, we study perfectly-secure multi-party computation (MPC) against
general (non-threshold) adversaries. Known protocols in a synchronous network
are secure against $Q^{(3)}$ adversary structures, while in an asynchronous
network, known protocols are secure against $Q^{(4)}$ adversary structures. A
natural question is whether there exists a single protocol which remains secure
against $Q^{(3)}$ and $Q^{(4)}$ adversary structures in a synchronous and in an
asynchronous network respectively, where the parties are not aware of the
network type. We design the first …

adversaries general