[LP09] A Proof of Security of Yao’s Protocol for Two-Party Computation

Authors: Yehuda Lindell, Benny Pinkas | Venue: Journal of Cryptology 2009 | Source

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 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.

BibTeX

Copy

@Article{JC:LinPin09,
  author = {Yehuda Lindell and Benny Pinkas},
  title = {A Proof of Security of {Yao}'s Protocol for Two-Party Computation},
  pages = {161--188},
  journal = {Journal of Cryptology},
  volume = {22},
  number = {2},
  month = {apr},
  publisher = {Springer},
  year = {2009},
  doi = {10.1007/s00145-008-9036-8},
}