Asynchronous Secure Multiparty Computation in Constant Time

International Workshop on Practice and Theory in Public Key Cryptography, pp. 183-207, 2016.

Cited by: 8|Bibtex|Views22
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

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 lea...More

Code:

Data:

Your rating :
0

 

Tags
Comments