Welcome to the resource topic for 2010/224
Title:
Efficient Implementation of the Orlandi Protocol Extended Version
Authors: Thomas P. Jakobsen, Marc X. Makkes, 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.
ePrint: https://eprint.iacr.org/2010/224
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .