### Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost

Ivan Damgård and Claudio Orlandi

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

Available format(s)
Category
Cryptographic protocols
Publication info
Published elsewhere. Full version of a CRYPTO 2010 paper.
Contact author(s)
orlandi @ cs au dk
History
Short URL
https://ia.cr/2010/318

CC BY

BibTeX

@misc{cryptoeprint:2010/318,
author = {Ivan Damgård and Claudio Orlandi},
title = {Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost},
howpublished = {Cryptology ePrint Archive, Paper 2010/318},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/318}},
url = {https://eprint.iacr.org/2010/318}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.