Prof. Sebastian Faust (TU Darmstadt)
Prof. Stefan Dziembowski (University of Warsaw)
We initiate the study of multi-party computation (MPC) for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. As our main result, we present the first construction of *constant-round* MPC with post-quantum security. We assume mildly super-polynomial quantum hardness of learning with errors (LWE), and polynomial quantum hardness of an LWE-based circular security assumption.