Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
LEGO for Two-Party Secure Computation
verfasst von : Jesper Buus Nielsen, Claudio Orlandi
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.