TY - JOUR
T1 - A proof of security of yao's protocol for two-party computation
AU - Lindell, Yehuda
AU - Pinkas, Benny
PY - 2009/4
Y1 - 2009/4
N2 - In the mid 1980s, 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 theory of cryptography and in particular to the field of secure computation, to the best of our knowledge, this is the first time that an explicit proof of security has been published.
AB - In the mid 1980s, 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 theory of cryptography and in particular to the field of secure computation, to the best of our knowledge, this is the first time that an explicit proof of security has been published.
KW - Proofs of security
KW - Secure two-party computation
KW - Semi-honest adversaries
KW - Yao's two-party protocol
UR - http://www.scopus.com/inward/record.url?scp=64249101946&partnerID=8YFLogxK
U2 - 10.1007/s00145-008-9036-8
DO - 10.1007/s00145-008-9036-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:64249101946
SN - 0933-2790
VL - 22
SP - 161
EP - 188
JO - Journal of Cryptology
JF - Journal of Cryptology
IS - 2
ER -