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

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 κ garbled circuits; some fraction of those are “checked” by the other party, and the remaining fraction are evaluated. We introduce… (More)
DOI: 10.1007/978-3-642-40084-1_2

Topics

Statistics

0102030201320142015201620172018
Citations per Year

96 Citations

Semantic Scholar estimates that this publication has 96 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics