Annual Cryptology Conference

CRYPTO 2010: Advances in Cryptology – CRYPTO 2010 pp 558-576

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

  • Ivan Damgård
  • Claudio Orlandi
Conference paper

DOI: 10.1007/978-3-642-14623-7_30

Volume 6223 of the book series Lecture Notes in Computer Science (LNCS)

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Claudio Orlandi
    • 1
  1. 1.Department of Computer ScienceAarhus University