Secure Multi-Party Computation (MPC) with Go. This project implements secure two-party computation with Garbled circuit protocol.
-
Updated
Oct 23, 2024 - Go
Secure Multi-Party Computation (MPC) with Go. This project implements secure two-party computation with Garbled circuit protocol.
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
Add a description, image, and links to the yao-millionaires topic page so that developers can more easily learn about it.
To associate your repository with the yao-millionaires topic, visit your repo's landing page and select "manage topics."