Most protocols for multi-party computation (MPC) are secure either
against information-theoretic (IT) or against computationally bounded
adversaries. In this work, we bring together the best of both worlds:
For any robustness parameter $\rob