CryptoDB
A Proof of Yao's Protocol for Secure Two-Party Computation
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2004-12147, title={A Proof of Yao's Protocol for Secure Two-Party Computation}, booktitle={IACR Eprint archive}, keywords={foundations / secure two-party computation, Yao's protocol}, url={http://eprint.iacr.org/2004/175}, note={ lindell@us.ibm.com 12622 received 21 Jul 2004, last revised 23 Jul 2004}, author={Yehuda Lindell and Benny Pinkas}, year=2004 }