Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR04-063 | 11th January 2011 09:02

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

RSS-Feed




Revision #1
Authors: Yehuda Lindell, Benny Pinkas
Accepted on: 11th January 2011 09:02
Downloads: 1094
Keywords: 


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.


Paper:

TR04-063 | 23rd July 2004 00:00

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





TR04-063
Authors: Yehuda Lindell, Benny Pinkas
Publication: 29th July 2004 14:19
Downloads: 2420
Keywords: 


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.



ISSN 1433-8092 | Imprint