# cryptopp.com

 Random Link ¯\_(ツ)_/¯ Jan 22, 2019 » Secure Multiparty Computation 3 min; updated Oct 27, 2021 Timeline of Secure Multi-Party Communication In 1982, secure two-party computation (2PC) was introduced for problems that are boolean predicates, e.g. Yao’s Millionaires' Problem that asks whether $$a \ge b$$ is true without revealing the actual values of $$a$$ and $$b$$. Andrew Yao generalized 2PC for any feasible computation in 1986. Goldreich, Micali and Wigderson later generalized it to secure multiparty communication. Yao-based protocols requires that the function to be securely evaluated be represented as a circuit, but an efficient transformation is not trivial....