Theory of Cryptography Conference

TCC 2009: Theory of Cryptography pp 368-386

LEGO for Two-Party Secure Computation

  • Jesper Buus Nielsen
  • Claudio Orlandi
Conference paper

DOI: 10.1007/978-3-642-00457-5_22

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

Abstract

This paper continues the recent line of work of making Yao’s garbled circuit approach to two-party computation secure against an active adversary. We propose a new cut-and-choose based approach called LEGO (Large Efficient Garbled-circuit Optimization): It is specifically aimed at large circuits. Asymptotically it obtains a factor \(\log\vert\mathcal{C}\vert\) improvement in computation and communication over previous cut-and-choose based solutions, where \(\vert\mathcal{C}\vert\) is the size of the circuit being computed. The protocol is universally composable (UC) in the OT-hybrid model against a static, active adversary.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jesper Buus Nielsen
    • 1
  • Claudio Orlandi
    • 1
  1. 1.BRICS, Department of Computer ScienceAarhus University