Multi-party secure computation (MPC) is a cryptographic mechanism enabling multiple entities to jointly compute functions over their private inputs without revealing individual data beyond the final result, formalized through ideal functionality abstractions and simulation-based security definitions like universally composable security. The theory establishes correctness via functional equivalence under restricted communication models involving pairwise authenticated channels and defines privacy against semi-honest or malicious corruptions using an integer parameter *t* to bound the number of colluding parties who learn no information other than their own outputs and the function output. This concept belongs to theoretical cryptography within distributed computing, extending two-party settings to general functionalities via gate-by-gate evaluation or secret sharing schemes over specific algebraic groups such as $\mathbb{Z}_m$ and $\mathbb{Z}^*_n$.
Multi-party secure computation (MPC) is a cryptographic mechanism enabling multiple entities to jointly compute functions over their private inputs without revealing individual data beyond the final …