awesome-mpc

Allows two people to find out if they are secretly in love with each other using malicious secure 2PC of a single AND gate.

2PC with secret sharing and garbled circuits; secure against semi-honest adversaries. |

3PC with secret sharing for privacy preserving machine learning and database joins (PSI, Union, etc.); secure against semi-honest adversaries. |

Rust pseudo-random number generator based on AES.

OT Extension secure against malicious adversaries. |

Private Set Intersection. |

Collection of MPC protocols for several real-world tasks such as statistics.

A broad introduction to the field of secure multi-party computation, covering both the fundamental constructions and many of the recent improvements. The book emphasizes the intuition and ideas behind the protocols rather than rigorous proofs.

Course on MPC, Homomorphic Encryption and related topics given by Claudio Orlandi at Aarhus University.

Comprehensive study of efficient protocols and techniques for secure two-party computation – both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest.

'Informal grad course' in FHE and MPC.

Light compilation of basic resources for getting started in MPC study and research.

Frequently updated list of secure computation papers appearing on IACR eprint.

A hub for real-world MPC deployments maintained by UC Berkeley EECS Security Group.

Covers basic and advanced topics related to the theory of MPC aimed at CS students and researchers interested in cryptography.

Real World MPC (RWMPC) Workshop. Started in 2025 and is co-located with the

Conducted at Simons institute for Theory of Computing.

Introductory lectures for basic secure computation constructions.

Tutorials and recent advances in secure computation delivered in video format.

Yearly workshop on theory and practice of MPC that started in Aarhus 2012. It has now become one of the biggest workshops for MPC people.