Abstract: Secure Two-party Computation (2PC) was introduced in 1982 by Yao to address the so-called millionaires problem:
"two millionaires wish to know who is richer; however, they do not want to find out inadvertently any additional information about each other's wealth".
More generally, 2PC is a special case of multiparty computation, in which two distrusting parties wish to jointly compute a function of their private inputs without revealing anything other than what can be inferred from their own input and prescribed output.
In this talk, we will retrace some of the fundamental stages for 2PC, starting from the ideas developed, in the late 1980s, by Yao on the one hand, and Goldreich, Micali and Wigderson on the other hand.
This post is also available in:
Link identifier #identifier__51268-5
Eng