This project contains a collection of tools and algorithms for performing secure computations in a collaborative environment. SMPC allows multiple parties to jointly compute a function over their private inputs, without revealing anything except the output. This implementation of SMPC solves for a basic “greater than” problem - also know as Yao’s Millionaires’ Problem. The Yao’s Millionaires’ Problem, introduced in 1982 by computer scientist Andrew Yao, is a secure multi-party computation issue where two millionaires, Alice and Bob, aim to determine their relative wealth without revealing their actual financial information.
