CryptoDB
Efficient Implementation of the Orlandi Protocol Extended Version
Authors: | |
---|---|
Download: | |
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 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. |
BibTeX
@misc{eprint-2010-23125, title={Efficient Implementation of the Orlandi Protocol Extended Version}, booktitle={IACR Eprint archive}, keywords={implementation / Secure multiparty computation, MPC, homomorphic encryption, protocols}, url={http://eprint.iacr.org/2010/224}, note={A non-extended version is accepted at the Applied Cryptography and Network Security Conference 2010 janus.nielsen@alexandra.dk 14719 received 20 Apr 2010, last revised 20 Apr 2010}, author={Thomas P. Jakobsen and Marc X. Makkes and Janus Dam Nielsen}, year=2010 }