Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose

  • Yan Huang
  • Jonathan Katz
  • David Evans
Conference paper

DOI: 10.1007/978-3-642-40084-1_2

Volume 8043 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Huang Y., Katz J., Evans D. (2013) Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. In: Canetti R., Garay J.A. (eds) Advances in Cryptology – CRYPTO 2013. Lecture Notes in Computer Science, vol 8043. Springer, Berlin, Heidelberg

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 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Yan Huang
    • 1
  • Jonathan Katz
    • 1
  • David Evans
    • 2
  1. 1.Dept. of Computer ScienceUniversity of MarylandUSA
  2. 2.Dept. of Computer ScienceUniversity of VirginiaUSA