521 search results - page 7 / 105 » Scalable Secure Multiparty Computation |
ACNS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
FC
2009
Springer
14 years 2 months ago
2009
Springer
In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptogr...
JCIT
2010
13 years 2 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...