You are looking at a specific version 20101115:104554 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF PS
Category
Implementation
Publication info
Published elsewhere. A non-extended version is accepted at the Applied Cryptography and Network Security Conference 2010
Keywords
Secure multiparty computationMPChomomorphic encryptionprotocols
Contact author(s)
janus nielsen @ alexandra dk
History
2010-11-15: revised
2010-04-28: received
See all versions
Short URL
https://ia.cr/2010/224
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.