Secure Multi-Party Computation (MPC) framework written in Go. Implements two-party garbled circuits (Yao) and the Goldreich-Micali-Wigderson (GMW) protocol for secure computation.

Implementation of Yao's Millionaires' Problem using Enigma secret contracts

Implementation of Yao's Millionare problem in Rust

Yao's Millionaires' problem is a secure multi-party computation problem which was introduced in 1982 by computer scientist and computational theorist Andrew Yao. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is richer without revealing their actual wealth