Efficient, Actively Secure MPC with a Dishonest Majority: A Survey

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits.

On the Round Complexity of Dishonest-Majority MPC

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing

Communication-Efficient Proactive MPC for Dynamic Groups with Dishonest Majorities

Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size

Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost