Welcome to the resource topic for 2004/175
Title:
A Proof of Yao’s Protocol for Secure Two-Party Computation
Authors: Yehuda Lindell, Benny Pinkas
Abstract:In the mid 1980’s, Yao presented a constant-round protocol for
securely computing any two-party functionality in the presence of
semi-honest adversaries (FOCS 1986). In this paper, we provide a
complete description of Yao’s protocol, along with a rigorous
proof of security. Despite the importance of Yao’s protocol to the
field of secure computation, to the best of our knowledge, this is
the first time that a proof of security has been published.
ePrint: https://eprint.iacr.org/2004/175
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .