The Round Complexity of Secure Protocols (Extended Abstract)

  title={The Round Complexity of Secure Protocols (Extended Abstract)},
  author={Donald Beaver and Silvio Micali and Phillip Rogaway},
In a network of n players, each player i having private input zi, we show how the players can collaboratively evaluate a function f ( z l , . . . , zn) in a way that does not compromise the privacy of the players ' inputs, and yet requires only a constant number of rounds of interaction. The underlying model of computat ion is a complete network of private channels, with broadcast, and a majority of the players must behave honestly. Our solution assumes the existence of a one-way function. 1 I… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 613 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 347 citations

613 Citations

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

See our FAQ for additional information.