A General Completeness Theorem for Two-Party Games

  title={A General Completeness Theorem for Two-Party Games},
  author={Joe Kilian},
MIT for Two-Party Games We consider 2-party cryptographic games of the following form. Alice and Bob choose inputs i and j, respectively, from some finite domain D. At the end of the game, Alice and Bob learn the value of l'(i, j), for some function F. We establish a necessary and sufficient condition on F and D, under which one can implement oblivious transfer. Bob should learn the value of C(i, j), where C' is some circuit agreed upon by Alice and Bob, but learn nothing else about i. Alice… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 97 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
64 Citations
0 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 64 extracted citations

97 Citations

Citations per Year
Semantic Scholar estimates that this publication has 97 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…