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 improvement in computation and communication over previous cut-and-choose based solutions, where is the size of the circuit being computed. The protocol is universally composable (UC) in the OT-hybrid model against a static, active adversary. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Nielsen, J. B., & Orlandi, C. (2009). LEGO for two-party secure computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5444 LNCS, pp. 368–386). https://doi.org/10.1007/978-3-642-00457-5_22
Mendeley helps you to discover research relevant for your work.