On the Computational Overhead of MPC with Dishonest Majority
Jesper Buus Nielsen, Samuel Ranellucci · Lecture notes in computer science · 2017
We consider the situation where a large number n of players want to securely compute a large function f with security against an adaptive, malicious adversary which might corrupt $$t 0$$ such that if at most dn parties are actually corrupted in a given execution, then the protocol will not abort. Our result is solely of theoretical interest. In its current form, it has not practical implications whatsoever.