Universally-Composable Two-Party Computation in Two Rounds

  title={Universally-Composable Two-Party Computation in Two Rounds},
  author={Omer Horvitz and Jonathan Katz},
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show here a universallycomposable (UC) protocol (in the common reference string model) for two-party computation of any functionality, where both parties receive output, using only two rounds. (This assumes honest parties are allowed to transmit messages simultaneously in any given round; we obtain a three-round protocol… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS


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

65 Citations

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

See our FAQ for additional information.

Similar Papers

Loading similar papers…