Welcome to the resource topic for 2010/318
Title:
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
Authors: Ivan Damgård, 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.
ePrint: https://eprint.iacr.org/2010/318
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 .