Cryptology ePrint Archive: Report 2010/224

Efficient Implementation of the Orlandi Protocol Extended Version

Thomas P. Jakobsen and Marc X. Makkes and Janus Dam Nielsen

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.

Category / Keywords: implementation / Secure multiparty computation, MPC, homomorphic encryption, protocols

Publication Info: A non-extended version is accepted at the Applied Cryptography and Network Security Conference 2010

Date: received 20 Apr 2010, last revised 15 Nov 2010

Contact author: janus nielsen at alexandra dk

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20101115:104554 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]