Cryptology ePrint Archive: Report 2004/175

A Proof of Yao's Protocol for Secure Two-Party Computation

Yehuda Lindell and 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.

Category / Keywords: foundations / secure two-party computation, Yao's protocol

Publication Info: Appeared in the Journal of Cryptology, 22(2):161-188, 2009

Date: received 21 Jul 2004, last revised 11 Jan 2011

Contact author: lindell at us ibm com

Available format(s): PDF | BibTeX Citation

Version: 20110111:080015 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]