CryptoDB
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
Authors: | |
---|---|
Download: | |
Abstract: | Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal of this paper is the design of efficient two and multi party computation protocols aimed to fill the gap between theory and practice. We propose a new protocol to securely evaluate reactive arithmetic circuits, that offers security against an active adversary in the universally composable security framework. Instead of the ``do-and-compile'' approach (where the parties use zero-knowledge proofs to show that they are following the protocol) our key ingredient is an efficient version of the ``cut-and-choose'' technique, that allow us to achieve active security for just a (small) constant amount of work more than for passive security. |
BibTeX
@misc{eprint-2010-23219, title={Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols /}, url={http://eprint.iacr.org/2010/318}, note={Full version of a CRYPTO 2010 paper. orlandi@cs.au.dk 14756 received 27 May 2010}, author={Ivan Damgård and Claudio Orlandi}, year=2010 }