Round Efficiency of Multi-party Computation with a Dishonest Majority

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… (More)

1 Figure or Table

Topics

Statistics

0510'05'07'09'11'13'15'17
Citations per Year

82 Citations

Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.