An Efficient Protocol for Fair Secure Two-Party Computation

@inproceedings{Kiraz2008AnEP,
  title={An Efficient Protocol for Fair Secure Two-Party Computation},
  author={Mehmet Sabir Kiraz and Berry Schoenmakers},
  booktitle={CT-RSA},
  year={2008}
}
? In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits. Later, several protocols based on garbled circuits covering malicious adversaries have been proposed. Only a few papers, however, discuss the fundamental property of fairness for two-party computation. So far the protocol by Pinkas (Eurocrypt 2003) is the only one which deals with fairness for Yao’s garbled… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS