Welcome to the resource topic for 2013/081
Title:
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
Authors: Yan Huang, Jonathan Katz, Dave Evans
Abstract: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 existing instantiations of this paradigm, one party generates \kappa 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 each party generates \kappa circuits to be checked by the other party. The main advantage of our technique is that the number \kappa of garbled circuits 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.
ePrint: https://eprint.iacr.org/2013/081
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .