Round Efficiency of Multi-party Computation with a Dishonest Majority

  title={Round Efficiency of Multi-party Computation with a Dishonest Majority},
  author={Jonathan Katz and Rafail Ostrovsky and Adam D. Smith},
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality and up to n−1 of these players may be arbitrarily malicious. Previous protocols for this setting (when a broadcast channel is available) require O(n) rounds. We present two protocols with improved round complexity: The first assumes only the existence of trapdoor permutations and dense cryptosystems… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS


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

87 Citations

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

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 35 references

Achieving independence eÆciently and securely

  • R. Gennaro.
  • ACM Symposium on Principles of Distributed…
  • 2002

Universal arguments of knowledge

  • B. Barak, O. Goldreich
  • In 17th IEEE Conference on Computational…
  • 2002
3 Excerpts

Similar Papers

Loading similar papers…