Cryptology ePrint Archive: Report 2010/318
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.
Category / Keywords: cryptographic protocols /
Publication Info: Full version of a CRYPTO 2010 paper.
Date: received 27 May 2010
Contact author: orlandi at cs au dk
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20100531:141030 (All versions of this report)
Short URL: ia.cr/2010/318
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]