Janus Dam Nielsen
Efficient Implementation of the Orlandi Protocol Extended Version
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 secure against up to $n-1$ static, active adversaries. An efficient implementation of an actively secure self-trust protocol enables a number of multiparty computation where one or more of the parties only trust himself. Examples includes auctions, negotiations, and online gaming. The efficiency of the implementation is largely obtained through an efficient implementation of the Paillier cryptosystem, also described in this paper.
Multiparty Computation Goes Live
In this note, we briefly report on the first large-scale and practical application of multiparty computation, which took place in January 2008.