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

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  • Department of Computer Science
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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)558-576
Number of pages19
Publication statusPublished - 2010
EventAnnual International Cryptology conference - Santa Barbara, CA, United States
Duration: 15 Aug 201019 Aug 2010


ConferenceAnnual International Cryptology conference
CountryUnited States
CitySanta Barbara, CA

Bibliographical note

Title of the vol.: Advances in Cryptology – CRYPTO 2010
30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings / ed. by Tal Rabin.
ISBN: 3642146228; 9783642146220

See relations at Aarhus University Citationformats

ID: 22314763