Welcome to the resource topic for 2016/762
Title:
Faster Secure Two-Party Computation in the Single-Execution Setting
Authors: Xiao Wang, Alex J. Malozemoff, Jonathan Katz
Abstract:We propose a new protocol for two-party computation, secure against malicious adversaries, that is significantly faster than prior work in the single-execution setting (i.e., non-amortized and with no pre-processing). In particular, for computational security parameter \kappa and statistical security parameter \rho, our protocol uses only \rho garbled circuits and O(\kappa) public-key operations, whereas previous work with the same number of garbled circuits required either O(\rho n + \kappa) public-key operations (where n is the input/output length) or a second execution of a secure-computation sub-protocol. Our protocol can be based on the decisional Diffie-Hellman assumption in the standard model. We implement our protocol to evaluate its performance. With \rho = 40, our implementation securely computes an AES evaluation in 65 ms over a local-area network using a single thread without any pre-computation, 22x faster than the best prior work in the non-amortized setting. The relative performance of our protocol is even better for functions with larger input/output lengths.
ePrint: https://eprint.iacr.org/2016/762
Talk: https://www.youtube.com/watch?v=Mhq1Oqwvu2g
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 .