Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
verfasst von : Yan Huang, Jonathan Katz, David Evans
Erschienen in: Advances in Cryptology – CRYPTO 2013
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
Beginning with the work of Lindell and Pinkas, researchers have proposed several protocols for secure two-party computation based on the
cut-and-choose
paradigm. In current instantiations of this approach, one party generates
κ
garbled circuits; some fraction of those are “checked” by the other party, and the remaining fraction are evaluated.
We introduce here the idea of
symmetric
cut-and-choose protocols, in which
both
parties generate
κ
circuits to be checked by the other party. The main advantage of our technique is that
κ
can be reduced by a factor of 3 while attaining the same statistical security level as in prior work. Since the number of garbled circuits dominates the costs of the protocol, especially as larger circuits are evaluated, our protocol is expected to run up to 3 times faster than existing schemes. Preliminary experiments validate this claim.