A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Asynchronous Secure Multiparty Computation in Constant Time
[chapter]
2016
Lecture Notes in Computer Science
In the setting of secure multiparty computation, a set of mutually distrusting parties wish to securely compute a joint function. It is well known that if the communication model is asynchronous, meaning that messages can be arbitrarily delayed by an unbounded (yet finite) amount of time, secure computation is feasible if and only if at least two-thirds of the parties are honest, as was shown by Ben-Or, Canetti, and Goldreich [STOC'93] and by Kelmer, and Rabin [PODC'94]. The running-time of all
doi:10.1007/978-3-662-49387-8_8
fatcat:pb5dkepxhbcutk5346c4cofv3e